Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
Settling the Computational Complexity of Max-Min Allocation with Ternary Valuations
Thi Ngoc Anh Vu, Trung Thanh Nguyen, Khaled Elbassioni +1
We study the problem of computing an allocation of indivisible items that maximizes egalitarian welfare, i.e., the utility of the worst-off agent, when agents' item values or margi…
cs.GT2021
Cutting a Cake Is Not Always a 'Piece of Cake': A Closer Look at the Foundations of Cake-Cutting Through the Lens of Measure Theory
Peter Kern, Daniel Neugebauer, Jörg Rothe +3
Cake-cutting is a playful name for the fair division of a heterogeneous, divisible good among agents, a well-studied problem at the intersection of mathematics, economics, and arti…