Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/53186 
Year of Publication: 
2011
Series/Report no.: 
Nota di Lavoro No. 88.2011
Publisher: 
Fondazione Eni Enrico Mattei (FEEM), Milano
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.
Subjects: 
Fair Division
Maxmin Allocation
Kalai Bargaining Solution
Cooperative Game Theory
JEL: 
D63
C61
C71
C78
Document Type: 
Working Paper

Files in This Item:
File
Size
459.14 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.