Brams–Taylor procedure

The Brams–Taylor theorem is a result in fair division discovered by Steven Brams and Alan D. Taylor. First published in the January 1995 issue of American Mathematical Monthly,[1] it explicated the first finite procedure to produce an envy-free division of an infinitely divisible good among any positive integer number of players.[2] Prior to the discovery of this theorem, Sol Garfunkel contended that the problem solved by the theorem, namely the n-person cake cutting problem, was among the most important problems in 20th century mathematics.[3]

References

  1. ^ Brams, Steven J.; Taylor, Alan D. (1995). "An Envy-Free Cake Division Protocol". The American Mathematical Monthly 102 (1): 9–18. 
  2. ^ http://m.discovermagazine.com/1995/mar/dividingthespoil479
  3. ^ More Equal than Others: Weighted Voting. Sol Garfunkel. For All Practical Purposes. COMAP. 1988