Maximin share and minimax envy in fair-division problems.

DOI10.1016/S0022-247X(03)00107-0MaRDI QIDQ1399324zbMATH OpenFDO

Authors Marco Dall'Aglio, Theodore P. Hill

Publication date 30 July 2003

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0022-247X(03)00107-0

zbMATH Keywords

cake-cuttingenvy-freeequitable partitionFair-divisionmaximin shareminimax envyoptimalpartition

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Minimax problems in mathematical programming (90C47)

Recommendations

• Envy-free division of discrete cakes
• Envy-free division of discrete cakes
• scientific article; zbMATH DE number 1409181
• scientific article; zbMATH DE number 1015852
• Super envy-free cake division and independence of measures

Cites work

• A Generalization of Lyapounov's Convexity Theorem to Measures with Atoms
• A sharp nonconvexity bound for partition ranges of vector measures with atoms
• A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures
• An Envy-Free Cake Division Protocol
• Fair division of a measurable space
• How to Cut A Cake Fairly
• scientific article; zbMATH DE number 1234106 (Why is no real title available?)
• scientific article; zbMATH DE number 1342356 (Why is no real title available?)
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• Inequalities for α-Optimal Partitioning of a Measurable Space
• Optimal Partitioning of a Measurable Space
• Optimal-Partitioning Inequalities for Nonatomic Probability Measures
• Partitioning general probability measures
• Partitioning inequalities in probability and statistics
• Super envy-free cake division and independence of measures

Cited in

(8)

• A comparison of formulations and solution methods for the minimum-envy location problem
• -maxmin solutions to fair division problems and the structure of the set of Pareto utility profiles
• Partitioning inequalities in probability and statistics
• Finding maxmin allocations in cooperative and competitive fair division
• Monotonicity and competitive equilibrium in cake-cutting
• Optimization problems in fair division theory.
• Fair division of goods in the shadow of market values
• A characterization of \(\alpha \)-maximin solutions of fair division problems

This page was built for publication: Maximin share and minimax envy in fair-division problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399324)