Finding Maxmin Allocations in Cooperative and Competitive Fair Division
Date
22.11.2011
22.11.2011
Authors
Marco Dall’Aglio, Camilla Di Luca
JEL Code
D63, C61, C71,C78
D63, C61, C71,C78
Keywords:
Fair Division, Maxmin Allocation, Kalai Bargaining Solution, Cooperative Game Theory
Fair Division, Maxmin Allocation, Kalai Bargaining Solution, Cooperative Game Theory
Publisher
Economy and Society
Economy and Society
Editor
Giuseppe Sammarco
Giuseppe Sammarco
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.