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.

MoreLess

Year of publication:	2011
Authors:	Dall'Aglio, Marco ; Di Luca, Camilla
Publisher:	Milano : Fondazione Eni Enrico Mattei (FEEM)
Subject:	Fair Division \| Maxmin Allocation \| Kalai Bargaining Solution \| Cooperative Game Theory

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Series:	Nota di Lavoro ; 88.2011
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	675908647 [GVK] hdl:10419/53186 [Handle]
Classification:	D63 - Equity, Justice, Inequality, and Other Normative Criteria and Measurement ; C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; C71 - Cooperative Games ; C78 - Bargaining Theory; Matching Theory
Source:	EconStor

Persistent link: https://www.econbiz.de/10010279415