On Maxsum Fair Cake Divisions
暂无分享,去创建一个
Ariel D. Procaccia | Michal Feldman | Steven J. Brams | John K. Lai | Jamie Morgenstern | M. Feldman | S. Brams | Jamie Morgenstern
[1] Ning Chen,et al. Optimal Proportional Cake Cutting with Connected Pieces , 2012, AAAI.
[2] Ariel D. Procaccia,et al. Optimal Envy-Free Cake Cutting , 2011, AAAI.
[3] Steven J. Brams,et al. N-Person Cake-Cutting: There May Be No Perfect Division , 2011, Am. Math. Mon..
[4] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[5] Ioannis Caragiannis,et al. The Efficiency of Fair Division , 2009, Theory of Computing Systems.
[6] Yann Chevaleyre,et al. Issues in Multiagent Resource Allocation , 2006, Informatica.
[7] V. Vazirani. Algorithmic Game Theory: Combinatorial Algorithms for Market Equilibria , 2007 .
[8] Hans Reijnierse,et al. On finding an envy-free Pareto-optimal division , 1998, Math. Program..
[9] Ariel D. Procaccia. Thou Shalt Covet Thy Neighbor's Cake , 2009, IJCAI.
[10] Ariel D. Procaccia,et al. Truth, justice, and cake cutting , 2010, Games Econ. Behav..
[11] Jack M. Robertson,et al. Cake-cutting algorithms - be fair if you can , 1998 .
[12] Ariel D. Procaccia,et al. Towards More Expressive Cake Cutting , 2011, IJCAI.