Finding Maxmin Allocations in Cooperative and Competitive Fair Division
2017
Dall'Aglio, Marco | Di Luca, Camilla
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.
Show more [+] Less [-]Bibliographic information
Type
Text
Source
http://ageconsearch.umn.edu/record/120020
2021-02-15
AGRIS AP
Data Provider
This bibliographic record has been provided by University of Minnesota
Links
If you notice any incorrect information relating to this record, please contact us at agris@fao.org
