Surplus procedure
 | This article provides insufficient context for those unfamiliar with the subject. (November 2014) |
The surplus procedure (SP) is a fair division protocol for dividing goods in a way that achieves proportional equitability. It can be generalized to more than 2=two people and is strategyproof. For three or more people it is not always possible to achieve a division that is both equitable and envy-free.
The surplus procedure was devised by Steven J. Brams, Michael A. Jones, and Christian Klamler in 2006.[1]
A generalization of the surplus procedure called the equitable procedure (EP) achieves a form of equitability. Equitability and envy-freeness can be incompatible for 3 or more players.[2]
Criticisms of the paper
[edit]There have been a few criticisms of aspects of the paper.[3] In effect the paper should cite a weaker form of Pareto optimality and suppose the measures are always strictly positive.
See also
[edit]References
[edit]- ^ Better Ways to Cut a Cake by Steven J. Brams, Michael A. Jones, and Christian Klamler in the Notices of the American Mathematical Society December 2006.
- ^ Brams, Steven J.; Michael A. Jones; Christian Klamler (December 2006). "Better Ways to Cut a Cake" (PDF). Notices of the American Mathematical Society. 53 (11): 1314–1321. Retrieved 2008-01-16.
- ^ Cutting Cakes Correctly by Theodore P. Hill, School of Mathematics, Georgia Institute of Technology, Atlanta, GA, 2008
 | This game theory article is a stub. You can help Wikipedia by expanding it. |