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

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

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