6 citations · 25 across the 31 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
No, Cake Cutting Really is a Piece of Cake
Stephen Arndt, Benjamin Moseley, Sungjin Im +1
We design and analyze a deterministic cake cutting algorithm that achieves proportional fairness using a linear number of cuts. The best previous upper bound on the number of cuts…
cs.GT2015★ 6 cited
The one-dimensional Euclidean domain: Finitely many obstructions are not enough
Jiehua Chen, Kirk Pruhs, Gerhard J. Woeginger
We show that one-dimensional Euclidean preference profiles can not be characterized in terms of finitely many forbidden substructures. This result is in strong contrast to the case…