Partitioning general probability measures
From MaRDI portal
Publication:579730
DOI10.1214/aop/1176992173zbMath0625.60004OpenAlexW2115525955MaRDI QIDQ579730
Publication date: 1987
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176992173
atomic probability measuresBounds for the accuracy of the partitionscake- cuttingfair division problemsminimax decision rulesoptimal-partitioning inequalities
Asymptotic distribution theory in statistics (62E20) Probabilistic measure theory (60A10) Probability theory on linear topological spaces (60B11) Classical measure theory (28A99)
Related Items
A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures ⋮ On maximin share allocations in matroids ⋮ Equitable distribution of indivisible objects ⋮ A Protocol for Cutting Matroids Like Cakes ⋮ Maximin share and minimax envy in fair-division problems. ⋮ Fairly taking turns ⋮ On totally balanced games arising from cooperation in fair division ⋮ A Proportionality Principle for Partitioning Problems ⋮ A sharp nonconvexity bound for partition ranges of vector measures with atoms ⋮ Worst case compromises in matroids with applications to the allocation of indivisible goods
This page was built for publication: Partitioning general probability measures
