Finding Maxmin Allocations in Cooperative and Competitive Fair Division

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.


Issue Date:
2011-11
Publication Type:
Working or Discussion Paper
PURL Identifier:
http://purl.umn.edu/120020
Total Pages:
23
JEL Codes:
D63; C61; C71; C78
Series Statement:
ES
88.2011




 Record created 2017-04-01, last modified 2017-04-26

Fulltext:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)