Sharing a Cake

A.K. Austin

doi:10.2307/3616548

Extract

It is well known that if two people wish to share a cake fairly then one cuts it into two pieces and the other person chooses which of the pieces to have. This article considers the problem of sharing the cake fairly when there are more than two people. We are looking for procedures which ensure justice for an honest person even when there is dishonest collusion by the other people.

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Brams, Steven J. and Taylor, Alan D. 1995. An Envy-Free Cake Division Protocol. The American Mathematical Monthly, Vol. 102, Issue. 1, p. 9.

Brams, Steven J. Taylor, Alan D. and Zwicker, William S. 1995. Old and new moving-knife schemes. The Mathematical Intelligencer, Vol. 17, Issue. 4, p. 30.

Webb, William A. 1997. How to cut a cake fairly using a minimal number of cuts. Discrete Applied Mathematics, Vol. 74, Issue. 2, p. 183.

Fishburn, Peter 1997. The Fairest Cut of All. Review ofFair Division: From Cake–Cutting to Dispute Resolution,by Steven J. Brams and Allan D. Taylor. Journal of Mathematical Psychology, Vol. 41, Issue. 4, p. 444.

Webb, William A. 1999. An Algorithm For Super Envy-Free Cake Division. Journal of Mathematical Analysis and Applications, Vol. 239, Issue. 1, p. 175.

Sen, S. and Biswas, A. 2000. More than envy-free. p. 433.

Jones, Michael A. 2002. Equitable, Envy-free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods. Mathematics Magazine, Vol. 75, Issue. 4, p. 275.

Peterson, Elisha and Su, Francis Edward 2002. Four-Person Envy-Free Chore Division. Mathematics Magazine, Vol. 75, Issue. 2, p. 117.

Simmons, Forest W. and Su, Francis Edward 2003. Consensus-halving via theorems of Borsuk-Ulam and Tucker. Mathematical Social Sciences, Vol. 45, Issue. 1, p. 15.

Taylor, Alan D. 2005. A paradoxical Pareto frontier in the cake-cutting context. Mathematical Social Sciences, Vol. 50, Issue. 2, p. 227.

IYER, KARTHIK and HUHNS, MICHAEL N. 2009. A PROCEDURE FOR THE ALLOCATION OF TWO-DIMENSIONAL RESOURCES IN A MULTIAGENT SYSTEM. International Journal of Cooperative Information Systems, Vol. 18, Issue. 03n04, p. 381.

Manabe, Yoshifumi and Okamoto, Tatsuaki 2010. Mathematical Foundations of Computer Science 2010. Vol. 6281, Issue. , p. 501.

Thomson, William 2011. Vol. 2, Issue. , p. 393.

CrossRef

Manabe, Yoshifumi and Okamoto, Tatsuaki 2012. Meta-envy-free Cake-cutting and Pie-cutting Protocols. Journal of Information Processing, Vol. 20, Issue. 3, p. 686.

Volk, Florian Sokoli, Florian Hauke, Sascha and Muhlhauser, Max 2013. Formalizing and Modeling Fairness for Benefit Distribution in Collaborations. p. 412.

Olvera-López, William and Sánchez-Sánchez, Francisco 2014. An algorithm based on graphs for solving a fair division problem. Operational Research, Vol. 14, Issue. 1, p. 11.

Guo, Rongxing 2015. Cross-Border Management. p. 119.

Ihara, Takamasa Todo, Taiki Sakurai, Yuko and Yokoo, Makoto 2017. Cake Cutting for All-or-Nothing Utility. Transactions of the Japanese Society for Artificial Intelligence, Vol. 32, Issue. 5, p. AG16-E_1.

Guo, Rongxing 2018. Cross-Border Resource Management. p. 109.

Chèze, Guillaume 2019. Cake cutting: Explicit examples for impossibility results. Mathematical Social Sciences, Vol. 102, Issue. , p. 68.

Download full list

Article contents

Sharing a Cake

Extract

Access options

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Article contents

Sharing a Cake

Extract

Access options

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests