A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures

DOI10.1007/BF00320087zbMath0595.60021OpenAlexW1998329457MaRDI QIDQ1077801

Theodore P. Hill

Publication date: 1987

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00320087

zbMATH Keywords

minimax riskoptimal-partitioning inequalitiesnon-atomic probability measurescake-cutting inequality

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Decision theory (91B06) Minimax procedures in statistical decision theory (62C20) Probabilistic measure theory (60A10) Classical measure theory (28A99)

Related Items (4)

Equitable distribution of indivisible objects ⋮ Maximin share and minimax envy in fair-division problems. ⋮ The Dubins-Spanier optimization problem in fair division theory ⋮ A sharp nonconvexity bound for partition ranges of vector measures with atoms

Cites Work

• Unnamed Item
• Partitioning general probability measures
• Equipartitioning common domains of non-atomic measures
• Equitable distribution of indivisible objects
• Relations among certain ranges of vector 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
• How to Cut A Cake Fairly
• Quelques théorèmes sur les mesures

This page was built for publication: A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures