Finding Maxmin Allocations in Cooperative and Competitive Fair Division

Marco Dall'Aglio and Camilla Di Luca
Additional contact information
Marco Dall'Aglio: LUISS University Rome, Italy
Camilla Di Luca: "G. D'Annunzio" University Pescara, Italy

No 2011.88, Working Papers from Fondazione Eni Enrico Mattei

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: Fair Division; Maxmin Allocation; Kalai Bargaining Solution; Cooperative Game Theory (search for similar items in EconPapers)
JEL-codes: C61 C71 C78 D63 (search for similar items in EconPapers)
Date: 2011-12
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://feem-media.s3.eu-central-1.amazonaws.com/w ... oads/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:fem:femwpa:2011.88

Access Statistics for this paper

More papers in Working Papers from Fondazione Eni Enrico Mattei Contact information at EDIRC.
Bibliographic data for series maintained by Alberto Prina Cerai ( this e-mail address is bad, please contact ).