The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods
Year of publication: |
2012
|
---|---|
Authors: | Kesten, Onur ; Yazıcı, Ayşe |
Published in: |
Economic theory : official journal of the Society for the Advancement of Economic Theory. - Berlin : Springer, ISSN 0938-2259, ZDB-ID 1059110-2. - Vol. 50.2012, 2, p. 463-488
|
Subject: | Güter | Goods | Unteilbare Güter | Indivisible goods | Allokationseffizienz | Allocative efficiency | Pareto-Optimum | Pareto efficiency | Verteilungsgerechtigkeit | Distributive justice | Neid | Envy | Kooperatives Spiel | Cooperative game | Neue politische Ökonomie | Public choice | Theorie | Theory |
-
The Undercut Procedure : An Algorithm for the Envy-Free Division of Indivisible Items
Brams, Steven J., (2009)
-
The undercut procedure : an algorithm for the envy-free division of indivisible items
Brams, Steven J., (2012)
-
A note on the undercut procedure
Aziz, Haris, (2015)
- More ...
-
The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods
Kesten, Onur, (2012)
-
The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods
Kesten, Onur, (2012)
-
A many-to-many ‘rural hospital theorem’
Klijn, Flip, (2014)
- More ...