Abstract
We study the problem of computing maximin share guarantees, a recently introduced fairness notion. Given a set of n agents and a set of goods, the maximin share of a single agent is the best that she can guarantee to herself, if she would be allowed to partition the goods in any way she prefers, into n bundles, and then receive her least desirable bundle. The objective then in our problem is to find a partition, so that each agent is guaranteed her maximin share. Our main result is a 2∕3-approximation, that runs in polynomial time for any number of agents, improving upon recent results in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
S. Bouveret and M. Lemaître, “Characterizing conflicts in fair division of indivisible goods using a scale of criteria”, International Conference on Autonomous Agents and Multi-Agent Systems, AAMAS’14 (2014), 1321–1328.
S.J. Brams and A.D. Taylor, “Fair division: from cake cutting to dispute resolution”, Cambrige University press, 1996.
E. Budish, “The combinatorial assignment problem: approximate competitive equilibrium from equal incomes”, Journal of Political Economy 119 (6) (2011), 1061–1103.
H. Moulin, “Uniform externalities: two axioms for fair allocation”, Journal of Public Economics 43 (3) (1990), 305–326.
A.D. Procaccia and J. Wang, “Fair enough: guaranteeing approximate maximin shares”, ACM Conference on Economics and Computation, EC’14 (2014), 675–692.
J.M. Robertson and W.A. Webb, “Cake cutting algorithms: be fair if you can”, AK Peters, 1998.
H. Steinhaus, “The problem of fair division”, Econometrica 16 (1948), 101–104.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Amanatidis, G., Markakis, E., Nikzad, A., Saberi, A. (2017). Approximation Algorithms for Computing Maximin Share Allocations. In: Díaz, J., Kirousis, L., Ortiz-Gracia, L., Serna, M. (eds) Extended Abstracts Summer 2015. Trends in Mathematics(), vol 6. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-51753-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-51753-7_9
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-51752-0
Online ISBN: 978-3-319-51753-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)