Arbeitspapier
Finding maxmin allocations in cooperative and competitive fair division
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.
- Language
-
Englisch
- Bibliographic citation
-
Series: Nota di Lavoro ; No. 88.2011
- Classification
-
Wirtschaft
Equity, Justice, Inequality, and Other Normative Criteria and Measurement
Optimization Techniques; Programming Models; Dynamic Analysis
Cooperative Games
Bargaining Theory; Matching Theory
- Subject
-
Fair Division
Maxmin Allocation
Kalai Bargaining Solution
Cooperative Game Theory
- Event
-
Geistige Schöpfung
- (who)
-
Dall'Aglio, Marco
Di Luca, Camilla
- Event
-
Veröffentlichung
- (who)
-
Fondazione Eni Enrico Mattei (FEEM)
- (where)
-
Milano
- (when)
-
2011
- Handle
- Last update
-
10.03.2025, 11:42 AM CET
Data provider
This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Arbeitspapier
Associated
- Dall'Aglio, Marco
- Di Luca, Camilla
- Fondazione Eni Enrico Mattei (FEEM)
Time of origin
- 2011
Other Objects (12)
Finding fair and efficient allocations
Tax Implementability of Fair Allocations
Perfectly fair allocations with indivisibilities
Computing core cost allocations for cooperative procurement
Solutions and fair cost allocations for cooperative lot sizing with transshipments and scare capacities
Complexity of finding Pareto-efficient allocations of highest welfare
Cooperative Competitive Advantages of International Supply Networks
Finding and verifying the nucleolus of cooperative games
Fair payments for efficient allocations in public sector combinatorial auctions
Labor Allocations
Newsprint Allocations
Allocations Militaires
Finding fair and efficient allocations
Tax Implementability of Fair Allocations
Perfectly fair allocations with indivisibilities
Computing core cost allocations for cooperative procurement
Solutions and fair cost allocations for cooperative lot sizing with transshipments and scare capacities
Complexity of finding Pareto-efficient allocations of highest welfare
Cooperative Competitive Advantages of International Supply Networks
Finding and verifying the nucleolus of cooperative games
Fair payments for efficient allocations in public sector combinatorial auctions
Labor Allocations
Newsprint Allocations
Allocations Militaires
Finding fair and efficient allocations
Tax Implementability of Fair Allocations
Perfectly fair allocations with indivisibilities
Computing core cost allocations for cooperative procurement
Solutions and fair cost allocations for cooperative lot sizing with transshipments and scare capacities
Complexity of finding Pareto-efficient allocations of highest welfare
Cooperative Competitive Advantages of International Supply Networks
Finding and verifying the nucleolus of cooperative games
Fair payments for efficient allocations in public sector combinatorial auctions
Labor Allocations
Newsprint Allocations