%0 Journal Article
%T Finding maxmin allocations in cooperative and competitive fair division
%A Marco Dall'Aglio
%A Camilla Di Luca
%J Mathematics
%D 2011
%I arXiv
%X 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.
%U http://arxiv.org/abs/1110.4241v3