Finding Maxmin Allocations in Cooperative and Competitive Fair Division
Marco Dall’Aglio, Camilla Di Luca
D63, C61, C71,C78
Fair Division, Maxmin Allocation, Kalai Bargaining Solution, Cooperative Game Theory
Economy and Society
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.