A sharp nonconvexity bound for partition ranges of vector measures with atoms

DOI10.1006/jmaa.1999.6402zbMath0955.28005OpenAlexW2080626399MaRDI QIDQ1300041

Pieter C. Allaart

Publication date: 25 October 1999

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

Full work available at URL: https://semanticscholar.org/paper/b1ad361361a22677ab363a2bfb93ef7a6fed529e

zbMATH Keywords

treedigraphLyapounov convexity theoremvector measurerangefair divisioncake-cutting problemoptimal partitioningpartition rangevector atom

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Inequalities; stochastic orderings (60E15) Vector-valued set functions, measures and integrals (28B05)

Related Items (1)

Maximin share and minimax envy in fair-division problems.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning general probability measures
• A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures
• Optimal-partitioning inequalities in classification and multi-hypotheses testing
• 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
• Discrete and Continuous Bang-Bang and Facial Spaces Or: Look for the Extreme Points
• A Characterization of Vector Measures with Convex Range

This page was built for publication: A sharp nonconvexity bound for partition ranges of vector measures with atoms