Approximate maximin shares for groups of agents
Top Cited Papers
- 1 March 2018
- journal article
- research article
- Published by Elsevier in Mathematical Social Sciences
- Vol. 92, 40-47
- https://doi.org/10.1016/j.mathsocsci.2017.09.004
Abstract
No abstract availableAll Related Versions
This publication has 22 references indexed in Scilit:
- Asymptotic existence of proportionally fair allocationsMathematical Social Sciences, 2016
- Approximation Algorithms for Computing Maximin Share AllocationsPublished by Springer Nature ,2015
- Characterizing conflicts in fair division of indivisible goods using a scale of criteriaAutonomous Agents and Multi-Agent Systems, 2015
- SplidditACM SIGecom Exchanges, 2015
- Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free AlgorithmNotices of the American Mathematical Society, 2014
- The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal IncomesJournal of Political Economy, 2011
- The undercut procedure: an algorithm for the envy-free division of indivisible itemsSocial Choice and Welfare, 2011
- A polynomial-time approximation scheme for maximizing the minimum machine completion timePublished by Elsevier ,1999
- Uniform externalitiesJournal of Public Economics, 1990
- Equity, envy, and efficiencyJournal of Economic Theory, 1974