Finding maxmin allocations in cooperative and competitive fair division
arXiv:1110.4241 · doi:10.1007/s10479-014-1611-9
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.
arXiv comment20 pages, 3 figures. This third version improves the overll presentation; Optimization and Control (math.OC), Computer Science and Game Theory (cs.GT), Probability (math.PR)
Cited by in corpus (4)
- Monotonicity and Competitive Equilibrium in Cake-cutting
- Fair Cake-Cutting among Families
- Bounds for alpha-Optimal Partitioning of a Measurable Space Based on Several Efficient Partitions
- Characterizing and Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three Players