Cake Cutting Algorithms
暂无分享,去创建一个
[1] Simina Brânzei,et al. Simultaneous Cake Cutting , 2014, AAAI.
[2] Haris Aziz,et al. Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations , 2013, WINE.
[3] Simina Brânzei,et al. Externalities in Cake Cutting , 2013, IJCAI.
[4] Ariel D. Procaccia,et al. How to Cut a Cake Before the Party Ends , 2013, AAAI.
[5] Ariel D. Procaccia,et al. No agent left behind: dynamic fair division of multiple resources , 2013, AAMAS.
[6] Simina Brânzei,et al. Equilibrium analysis in cake cutting , 2013, AAMAS.
[7] Avinatan Hassidim,et al. Computing socially-efficient cake divisions , 2012, AAMAS.
[8] Steven J. Brams,et al. N-Person Cake-Cutting: There May Be No Perfect Division , 2011, Am. Math. Mon..
[9] Ariel D. Procaccia,et al. Truth, justice, and cake cutting , 2010, Games Econ. Behav..
[10] Xiaotie Deng,et al. Algorithmic Solutions for Envy-Free Cake Cutting , 2012, Oper. Res..
[11] Noam Nisan,et al. Incentive Compatible Two Player Cake Cutting , 2012, WINE.
[12] Ning Chen,et al. Optimal Proportional Cake Cutting with Connected Pieces , 2012, AAAI.
[13] Ariel D. Procaccia,et al. On Maxsum Fair Cake Divisions , 2012, AAAI.
[14] Ariel D. Procaccia,et al. Beyond dominant resource fairness: extensions, limitations, and indivisibilities , 2012, EC '12.
[15] Noam Nisan,et al. Fair allocation without trade , 2012, AAMAS.
[16] Nathan Linial,et al. No justified complaints: on fair sharing of multiple resources , 2011, ITCS '12.
[17] Yonatan Aumann,et al. Throw One's Cake - and Eat It Too , 2011, SAGT.
[18] Ariel D. Procaccia,et al. Optimal Envy-Free Cake Cutting , 2011, AAAI.
[19] Ariel D. Procaccia,et al. Towards More Expressive Cake Cutting , 2011, IJCAI.
[20] Roie Zivan,et al. Can trust increase the efficiency of cake cutting algorithms? , 2011, AAMAS.
[21] Benjamin Hindman,et al. Dominant Resource Fairness: Fair Allocation of Multiple Resource Types , 2011, NSDI.
[22] Ioannis Caragiannis,et al. The Efficiency of Fair Division , 2009, Theory of Computing Systems.
[23] Dimitris Bertsimas,et al. The Price of Fairness , 2011, Oper. Res..
[24] Yonatan Aumann,et al. The Efficiency of Fair Division with Connected Pieces , 2010, WINE.
[25] Elchanan Mossel,et al. Truthful Fair Division , 2010, SAGT.
[26] Ariel D. Procaccia. Thou Shalt Covet Thy Neighbor's Cake , 2009, IJCAI.
[27] Ying Wang,et al. Cutting a Cake for Five People , 2009, AAIM.
[28] Jörg Rothe,et al. Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols , 2009, WINE.
[29] Yan Yu,et al. Strategic divide and choose , 2008, Games Econ. Behav..
[30] Walter Stromquist,et al. Envy-Free Cake Divisions Cannot be Found by Finite Protocols , 2008, Electron. J. Comb..
[31] Gerhard J. Woeginger,et al. On the complexity of cake cutting , 2007, Discret. Optim..
[32] V. Vazirani. Algorithmic Game Theory: Combinatorial Algorithms for Market Equilibria , 2007 .
[33] S. Brams,et al. Better Ways to Cut a Cake , 2006 .
[34] Kirk Pruhs,et al. Balanced Allocations of Cake , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[35] K. Pruhs,et al. Cake cutting really is not a piece of cake , 2006, SODA '06.
[36] Tim Roughgarden,et al. The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[37] Costas Busch,et al. Cake-Cutting Is Not a Piece of Cake , 2003, STACS.
[38] Jack M. Robertson,et al. Cake-cutting algorithms - be fair if you can , 1998 .
[39] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[40] S. Brams,et al. AN ENVY-FREE CAKE DIVISION PROTOCOL , 1995 .
[41] William S. Zwicker,et al. A Moving-Knife Solution to the Four-Person Envy-Free Cake-Division Problem , 1995 .
[42] Peter J. Hammond,et al. Interpersonal Comparisons of Well-being: Interpersonal comparisons of utility: Why and how they are and should be made , 1990 .
[43] Shimon Even,et al. A note on cake cutting , 1984, Discret. Appl. Math..
[44] W. Stromquist. How to Cut a Cake Fairly , 1980 .