The undercut procedure : an algorithm for the envy-free division of indivisible items
Year of publication: |
2012
|
---|---|
Authors: | Brams, Steven J. ; Kilgour, D. Marc ; Klamler, Christian |
Published in: |
Social choice and welfare. - Berlin : Springer, ISSN 0176-1714, ZDB-ID 855101-7. - Vol. 39.2012, 2/3, p. 615-631
|
Subject: | Neid | Envy | Unteilbare Güter | Indivisible goods | Verteilungsgerechtigkeit | Distributive justice | Allokationseffizienz | Allocative efficiency | Pareto-Optimum | Pareto efficiency | Neue politische Ökonomie | Public choice |
-
The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods
Kesten, Onur, (2012)
-
A note on the undercut procedure
Aziz, Haris, (2015)
-
Fair allocation of indivisible goods with minimum inequality or minimum envy
Cornilly, Dries, (2022)
- More ...
-
Two-Person Fair Division of Indivisible Items : An Efficient, Envy-Free Algorithm
Brams, Steven J., (2013)
-
Two-person fair division of indivisible items when envy-freeness is impossible
Brams, Steven J., (2022)
-
Maximin envy-free division of indivisible items
Brams, Steven J., (2017)
- More ...