Finding maxmin allocations in cooperative and competitive fair division
classification
🧮 math.OC
cs.GTmath.PR
keywords
allocationscompetitivecooperativemaxminalgorithmboundscompletelycompute
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.