Brams–Taylor procedure

From Wikipedia, the free encyclopedia
  (Redirected from Brams-Taylor procedure)
Jump to: navigation, search

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]

Brams and Taylor hold a joint US patent related to this result.[4] [5]


  1. ^ Brams, Steven J.; Taylor, Alan D. (1995). "An Envy-Free Cake Division Protocol". The American Mathematical Monthly 102 (1): 9–18. doi:10.2307/2974850. 
  2. ^
  3. ^ More Equal than Others: Weighted Voting. Sol Garfunkel. For All Practical Purposes. COMAP. 1988
  4. ^ US patent 5983205, Steven J. Brams & Alan D. Taylor, "Computer-based method for the fair division of ownership of goods", issued 1999-11-09, assigned to New York University 
  5. ^ Brams, Steven J.; Alan D. Taylor (1999-11-09), United States Patent: 5983205 - Computer-based method for the fair division of ownership of goods, retrieved 2014-04-29