Optimal-Partitioning Inequalities for Nonatomic Probability Measures

DOI10.2307/2000385zbMath0605.60022MaRDI QIDQ3742414

Theodore P. Hill, John H. Elton, Robert P. Kertz

Publication date: 1986

Full work available at URL: https://doi.org/10.2307/2000385

zbMATH Keywords

decision theory; measurable partition; cake-cutting theorem; discrete allocation problems

Mathematics Subject Classification ID

60E15: Inequalities; stochastic orderings

91B06: Decision theory

62C20: Minimax procedures in statistical decision theory

60A10: Probabilistic measure theory

91A35: Decision theory for games

28A99: Classical measure theory

Related Items

The Dubins-Spanier optimization problem in fair division theory, A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures, Equitable distribution of indivisible objects, On totally balanced games arising from cooperation in fair division, A sharp nonconvexity bound for partition ranges of vector measures with atoms, Maximin share and minimax envy in fair-division problems., Optimal partitioning of a measurable space into countably many sets, Optimal Partitioning of a Measurable Space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equipartitioning common domains of non-atomic measures
• Equitable distribution of indivisible objects
• On projections in \(L_1\)
• Relations among certain ranges of vector measures
• How to Cut A Cake Fairly
• Quelques théorèmes sur les mesures