Cake cutting: not just child's play

How to fairly allocate divisible resources, and why computer scientists should take notice.

[1]  K. Pruhs,et al.  Cake cutting really is not a piece of cake , 2006, SODA 2006.

[2]  Costas Busch,et al.  Cake-Cutting Is Not a Piece of Cake , 2003, STACS.

[3]  K. Arrow,et al.  Handbook of Social Choice and Welfare , 2011 .

[4]  Xiaotie Deng,et al.  Algorithmic Solutions for Envy-Free Cake Cutting , 2012, Oper. Res..

[5]  Hervé Moulin,et al.  Fair division and collective welfare , 2003 .

[6]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[7]  Dimitris Bertsimas,et al.  The Price of Fairness , 2011, Oper. Res..

[8]  Analysis and Simulation of a Fair Queuing Algorithm , 2008 .

[9]  Noam Nisan,et al.  Fair allocation without trade , 2012, AAMAS.

[10]  Yonatan Aumann,et al.  Throw One's Cake - and Eat It Too , 2011, SAGT.

[11]  D. Foley.  Resource allocation and the public sector , 1967 .

[12]  Benjamin Hindman,et al.  Dominant Resource Fairness: Fair Allocation of Multiple Resource Types , 2011, NSDI.

[13]  Gerhard J. Woeginger,et al.  On the complexity of cake cutting , 2007, Discret. Optim..

[14]  Ning Chen,et al.  Optimal Proportional Cake Cutting with Connected Pieces , 2012, AAAI.

[15]  Avinatan Hassidim,et al.  Computing socially-efficient cake divisions , 2012, AAMAS.

[16]  E. Friedman,et al.  Strategyproofness, Leontief Economies and the Kalai-Smorodinsky Solution , 2011 .

[17]  J. Schummer.  Strategy-proofness versus efficiency on restricted domains of exchange economies , 1996 .

[18]  Vincent Conitzer,et al.  Making decisions based on the preferences of multiple agents , 2010, CACM.

[19]  Ying Wang,et al.  Cutting a Cake for Five People , 2009, AAIM.

[20]  Ariel D. Procaccia,et al.  Optimal Envy-Free Cake Cutting , 2011, AAAI.

[21]  Ariel D. Procaccia,et al.  Truth, justice, and cake cutting , 2010, Games Econ. Behav..

[22]  Jack M. Robertson,et al.  Cake-cutting algorithms - be fair if you can , 1998 .

[23]  Steven J. Brams,et al.  N-Person Cake-Cutting: There May Be No Perfect Division , 2011, Am. Math. Mon..

[24]  Walter Stromquist,et al.  Envy-Free Cake Divisions Cannot be Found by Finite Protocols , 2008, Electron. J. Comb..

[25]  Ariel D. Procaccia.  Thou Shalt Covet Thy Neighbor's Cake , 2009, IJCAI.

[26]  Ariel D. Procaccia,et al.  On Maxsum Fair Cake Divisions , 2012, AAAI.

[27]  Ioannis Caragiannis,et al.  The Efficiency of Fair Division , 2009, Theory of Computing Systems.

[28]  Ariel D. Procaccia,et al.  Beyond Dominant Resource Fairness , 2015, ACM Trans. Economics and Comput..

[29]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[30]  Ariel D. Procaccia,et al.  How to Cut a Cake Before the Party Ends , 2013, AAAI.

[31]  Yonatan Aumann,et al.  The Efficiency of Fair Division with Connected Pieces , 2010, WINE.

[32]  S. Brams,et al.  Better Ways to Cut a Cake , 2006 .

[33]  Ariel D. Procaccia,et al.  No agent left behind: dynamic fair division of multiple resources , 2013, AAMAS.

[34]  Shimon Even,et al.  A note on cake cutting , 1984, Discret. Appl. Math..

[35]  W. Thomson.  Fair Allocation Rules , 2011 .

[36]  Elisha A. Pazner,et al.  Egalitarian Equivalent Allocations: A New Concept of Economic Equity , 1978 .

[37]  Steven J. Brams,et al.  Fair division - from cake-cutting to dispute resolution , 1998 .

[38]  W. Stromquist.  How to Cut a Cake Fairly , 1980 .

[39]  Elchanan Mossel,et al.  On approximately fair allocations of indivisible goods , 2004, EC '04.