Finding Maxmin Allocations in Cooperative and Competitive Fair Division

Marco Dall'Aglio and Camilla Di Luca

No 120020, Economy and Society from Fondazione Eni Enrico Mattei (FEEM)

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.

Keywords: Research; Methods/Statistical; Methods (search for similar items in EconPapers)
Pages: 23
Date: 2011-11
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ageconsearch.umn.edu/record/120020/files/NDL2011-088.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ags:feemso:120020

DOI: 10.22004/ag.econ.120020

Access Statistics for this paper

More papers in Economy and Society from Fondazione Eni Enrico Mattei (FEEM) Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search (aesearch@umn.edu).