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=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]

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


This article is issued from Wikipedia - version of the 10/6/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.