Finding Maxmin Allocations in Cooperative and Competitive Fair Division

Printer-friendly version
Working paper
Author/s: 
Marco Dall'Aglio, Camilla Di Luca
Issue number: 
2011.088
Publisher: 
FEEM
Year: 
2011
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.
Developed by Paolo Gittoi