Computing Values for Games of CooperativeFair Division
Marco Dall’Aglio, Camilla Di Luca · IRIS - Institutional Research Information System (Libera Università Internazionale degli Studi Sociali Guido Carli) · 2012
We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. These bounds are based on the convexity properties of the range of utility vectors associated to all possible divisions of the good. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.