Maximin share and minimax envy in fair-division problems.
type: Item
instance of: scholarly article
title: Maximin share and minimax envy in fair-division problems.
zbMATH Open document ID: 1033.90150
DOI: 10.1016/S0022-247X(03)00107-0
author: Marco Dall'Aglio
author: Theodore P. Hill
published in: Journal of Mathematical Analysis and Applications
publication date: 2003-07-30T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 49K35
zbMATH DE Number: 1956866
zbMATH Keywords: Fair-division
zbMATH Keywords: cake-cutting
zbMATH Keywords: maximin share
zbMATH Keywords: minimax envy
zbMATH Keywords: envy-free
zbMATH Keywords: optimal
zbMATH Keywords: partition
zbMATH Keywords: equitable partition
MaRDI profile type: Publication
cites work: A sharp nonconvexity bound for partition ranges of vector measures with atoms
cites work: Q4263954
cites work: Super envy-free cake division and independence of measures
cites work: An Envy-Free Cake Division Protocol
cites work: Q4338900
cites work: How to Cut A Cake Fairly
cites work: A Generalization of Lyapounov's Convexity Theorem to Measures with Atoms
cites work: Optimal-Partitioning Inequalities for Nonatomic Probability Measures
cites work: Partitioning general probability measures
cites work: A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures
cites work: Partitioning inequalities in probability and statistics
cites work: Inequalities for α-Optimal Partitioning of a Measurable Space
cites work: Optimal Partitioning of a Measurable Space
cites work: Q4221107
cites work: Fair division of a measurable space
description: scientific article; zbMATH DE number 1956866