Finding Maxmin Allocations in Cooperative and Competitive Fair Division
Dall'Aglio, Marco; Di Luca, Camilla
2011

Files

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.

Details

Title Finding Maxmin Allocations in Cooperative and Competitive Fair Division
Keywords
Author(s) Dall'Aglio, Marco
Di Luca, Camilla
Subject(s)
Issue Date 2011-11
Publication Type Working or Discussion Paper
DOI and Other Identifiers 10.22004/ag.econ.120020
Record Identifier https://ageconsearch.umn.edu/record/120020
PURL Identifier http://purl.umn.edu/120020
Language English
Total Pages 23
JEL Codes D63
C61
C71
C78
Series Statement ES
88.2011
Record Appears in Fondazione Eni Enrico Mattei (FEEM) > Economy and Society

PDF

Statistics

from
to
Export
Download Full History