Date of This Version
January 2012
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.
Recommended Citation
Dall'Aglio, Marco and Di Luca, Camilla, "Finding Maxmin Allocations in Cooperative and Competitive Fair Division" (January 30, 2012). Fondazione Eni Enrico Mattei Working Papers. Paper 639.
https://services.bepress.com/feem/paper639
COinS