Maximin share and minimax envy in fair-division problems.
From MaRDI portal
Publication:1399324
DOI10.1016/S0022-247X(03)00107-0zbMath1033.90150MaRDI QIDQ1399324
Marco Dall'Aglio, Theodore P. Hill
Publication date: 30 July 2003
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
partition; optimal; envy-free; equitable partition; cake-cutting; Fair-division; maximin share; minimax envy
90C47: Minimax problems in mathematical programming
49K35: Optimality conditions for minimax problems
Related Items
A characterization of \(\alpha \)-maximin solutions of fair division problems, A comparison of formulations and solution methods for the minimum-envy location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning general probability measures
- Fair division of a measurable space
- A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures
- A sharp nonconvexity bound for partition ranges of vector measures with atoms
- Partitioning inequalities in probability and statistics
- Super envy-free cake division and independence of measures
- Inequalities for α-Optimal Partitioning of a Measurable Space
- Optimal-Partitioning Inequalities for Nonatomic Probability Measures
- A Generalization of Lyapounov's Convexity Theorem to Measures with Atoms
- Optimal Partitioning of a Measurable Space
- How to Cut A Cake Fairly
- An Envy-Free Cake Division Protocol
