Brams–Taylor procedure

The Brams–Taylor procedure (BTP) is a procedure for envy-free cake-cutting. It explicated the first finite procedure to produce an envy-free division of a cake among any positive integer number of players. However, the procedure's runtime is not bounded by any function of the number of players, it can take an arbitrarily long (but always finite) time, depending on the valuation functions. In 2016, Aziz and Mackenzie discovered a protocol that is even bounded by the number of players; for more details, see here.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.