On Worst-Case Allocations in the Presence of Indivisible Goods
- 1 January 2011
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Truth, Justice, and Cake CuttingProceedings of the AAAI Conference on Artificial Intelligence, 2010
- Truthful Fair DivisionPublished by Springer Nature ,2010
- An approximation algorithm for max-min fair allocation of indivisible goodsPublished by Association for Computing Machinery (ACM) ,2007
- Cake-Cutting AlgorithmsPublished by Taylor & Francis ,1998
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- Equitable distribution of indivisible objectsMathematical Social Sciences, 1988
- Partitioning General Probability MeasuresThe Annals of Probability, 1987