Finding maxmin allocations in cooperative and competitive fair division
Optimization and Control
2017-03-24 v3 Computer Science and Game Theory
Probability
Abstract
We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.
Cite
@article{arxiv.1110.4241,
title = {Finding maxmin allocations in cooperative and competitive fair division},
author = {Marco Dall'Aglio and Camilla Di Luca},
journal= {arXiv preprint arXiv:1110.4241},
year = {2017}
}
Comments
20 pages, 3 figures. This third version improves the overll presentation; Optimization and Control (math.OC), Computer Science and Game Theory (cs.GT), Probability (math.PR)