Bounds for \(\alpha\)-optimal partitioning of a measurable space based on several efficient partitions
From MaRDI portal
Publication:2512678
DOI10.1016/j.jmaa.2014.12.056zbMath1316.90062arXiv1308.3504OpenAlexW2044765945MaRDI QIDQ2512678
Camilla Di Luca, Marco Dall'Aglio
Publication date: 30 January 2015
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.3504
fair divisionconvex analysisoptimal partitioningcake-cutting problemsDvoretzky-Wald-Wolfowitz convexity theoremmaxmin solution
Related Items
How to obtain an equitable optimal fair division, Optimal Fair Division for Measures with Piecewise Linear Density Functions
Cites Work
- Unnamed Item
- Unnamed Item
- How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\)
- Cooperation in dividing the cake
- On totally balanced games arising from cooperation in fair division
- Economies with land -- A game theoretical approach
- On the structure of Pareto optimal cake partitions
- Finding maxmin allocations in cooperative and competitive fair division
- Relations among certain ranges of vector measures
- Inequalities for α-Optimal Partitioning of a Measurable Space
- Optimal-Partitioning Inequalities for Nonatomic Probability Measures
- Optimal Partitioning of a Measurable Space
- How to Cut A Cake Fairly
- Other Solutions to Nash's Bargaining Problem
- Proportional Solutions to Bargaining Situations: Interpersonal Utility Comparisons
- The Dubins-Spanier optimization problem in fair division theory
