Mediated envy-free and efficient cake cutting with n=2? - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-19T11:19:49Z http://mathoverflow.net/feeds/question/1700 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/1700/mediated-envy-free-and-efficient-cake-cutting-with-n2 Mediated envy-free and efficient cake cutting with n=2? unluckyjoe 2009-10-21T18:13:57Z 2009-12-24T12:34:50Z <p>Is there an algorithm in literature to compute an efficient (pareto optimal) and envy free cake cutting when there are only n=2 players and a Mediator?</p> http://mathoverflow.net/questions/1700/mediated-envy-free-and-efficient-cake-cutting-with-n2/1706#1706 Answer by TonyK for Mediated envy-free and efficient cake cutting with n=2? TonyK 2009-10-21T19:00:39Z 2009-10-21T19:00:39Z <p>Huh? I cut, you choose. Why do we need a Mediator?</p> http://mathoverflow.net/questions/1700/mediated-envy-free-and-efficient-cake-cutting-with-n2/9673#9673 Answer by Joseph Malkevitch for Mediated envy-free and efficient cake cutting with n=2? Joseph Malkevitch 2009-12-24T12:34:50Z 2009-12-24T12:34:50Z <p>Take a look at:</p> <p><a href="http://ideas.repec.org/p/pad/wpaper/0022.html" rel="nofollow">http://ideas.repec.org/p/pad/wpaper/0022.html</a></p> <p>or the description of Crawford Divide and Choose as described in the book Equity: In Theory and Practice, by H. Peyton Young, Princeton U. Press.</p>