Finding Maxmin Allocations in Cooperative and Competitive Fair Division
No hay miniatura disponible
Fecha
Autores
Título de la revista
ISSN de la revista
Título del volumen
Editor
Resumen
Descripción
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.