Surplus procedure

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 people and is strategyproof. For 3 or more people it is not always possible to achieve a division that is both equitabile and envy-free.

The surplus procedure was devised by Steven J. Brams, Michael A. Jones, and Christian Klamler in 2006.[1]

Criticisms of the paper

There have been a few criticisms of aspects of the paper.[2] In effect the paper should cite a weaker form of Pareto optimality and suppose the measures are always strictly positive.

See also

References

  1. ^ 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.
  2. ^ Cutting Cakes Correctly by Theodore P. Hill, School of Mathematics, Georgia Institute of Technology, Atlanta, GA, 2008


Stub icon This game theory article is a stub. You can help Wikipedia by expanding it.
Last modified on 29 August 2012, at 05:01