Finding maxmin allocations in cooperative and competitive fair division

by Marco Dall'Aglio; Camilla Di Luca

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. -- Fair Division ; Maxmin Allocation ; Kalai Bargaining Solution ; Cooperative Game Theory

MoreLess

Year of publication:	2011
Authors:	Dall'Aglio, Marco ; Di Luca, Camilla
Publisher:	Milano : Fondazione Eni Enrico Mattei
Subject:	Allokation \| Allocation \| Allokationseffizienz \| Allocative efficiency \| Verteilungsgerechtigkeit \| Distributive justice \| Spieltheorie \| Game theory \| Auktionstheorie \| Auction theory \| Wettbewerb \| Competition

freely available

Full text |

More access options

www.feem.it

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

I need help

Extent:	Online-Ressource (PDF-Datei: 18 S., 459,14 KB) graph. Darst.
Series:	Working paper. - Milan : [Verlag nicht ermittelbar], ZDB-ID 2217241-5. - Vol. 88.2011
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Arbeitspapier ; Working Paper ; Graue Literatur ; Non-commercial literature
Language:	English
Notes:	Systemvoraussetzungen: Acrobat Reader
Other identifiers:	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:	ECONIS - Online Catalogue of the ZBW

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