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:	2012
Authors:	Dall'Aglio, Marco
Other Persons:	Di Luca, Camilla (contributor)
Publisher:	[2012]: [S.l.] : SSRN
Subject:	Allokation \| Allocation \| Allokationseffizienz \| Allocative efficiency \| Verteilungsgerechtigkeit \| Distributive justice \| Spieltheorie \| Game theory \| Auktionstheorie \| Auction theory \| Wettbewerb \| Competition

freely available

Full text |

More access options

doi.org

Check Google Scholar

In German libraries (KVK)

I need help

Extent:	1 Online-Ressource (23 p)
Series:	FEEM Working Paper ; No. 88.2011
Type of publication:	Book / Working Paper
Language:	English
Notes:	Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments September 28, 2012 erstellt
Other identifiers:	10.2139/ssrn.1988819 [DOI]
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/10013112094