How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\)
From MaRDI portal
Publication:439239
DOI10.1016/j.jmaa.2012.04.062zbMath1254.60008OpenAlexW1988555684MaRDI QIDQ439239
Jerzy Legut, Maciej Wilczyński
Publication date: 1 August 2012
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2012.04.062
Pareto principlefair divisionNeyman-Pearson lemmaLyapunov convexity theoremcake cutting problemoptimal partitioningrange of vector measure
Related Items (3)
Bounds for \(\alpha\)-optimal partitioning of a measurable space based on several efficient partitions ⋮ How to obtain an equitable optimal fair division ⋮ Optimal Fair Division for Measures with Piecewise Linear Density Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of \(\alpha \)-maximin solutions of fair division problems
- Fair division of a measurable space
- Dividing a cake fairly
- Geometric properties of the range of two-dimensional quasi-measures with respect to the Radon-Nikodým property
- Optimal partitioning of a measurable space into countably many sets
- Old and new moving-knife schemes
- 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
- A moving-knife solution to the four-person envy-free cake-division problem
- Probability for Statisticians
- An Envy-Free Cake Division Protocol
- Testing Statistical Hypotheses
- On the geometry of cake division
This page was built for publication: How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\)
