暂无分享,去创建一个
Paul W. Goldberg | Alexandros Hollender | Warut Suksompong | Paul W Goldberg | Warut Suksompong | Alexandros Hollender
[1] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[2] Robert E. Tarjan,et al. Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines , 1981, SIAM J. Comput..
[3] Paul G. Spirakis,et al. An Optimization Approach for Approximate Nash Equilibria , 2007, WINE.
[4] Simina Brânzei,et al. The Query Complexity of Cake Cutting , 2017, NeurIPS.
[5] Siddharth Barman,et al. Fair and Efficient Cake Division with Connected Pieces , 2019, WINE.
[6] SU Francisedward. RENTAL HARMONY : SPERNER ’ S LEMMA IN FAIR DIVISION , 2000 .
[7] Erel Segal-Halevi,et al. Redividing the cake , 2016, Autonomous Agents and Multi-Agent Systems.
[8] Vijay Menon,et al. Deterministic, Strategyproof, and Fair Cake Cutting , 2017, IJCAI.
[9] Katarína Cechlárová,et al. On the computability of equitable divisions , 2012, Discret. Optim..
[10] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[11] Yonatan Aumann,et al. The Efficiency of Fair Division with Connected Pieces , 2010, WINE.
[12] Xiaohui Bei,et al. Connected Fair Allocation of Indivisible Goods , 2019, ArXiv.
[13] Erel Segal-Halevi,et al. Waste Makes Haste , 2015, ACM Trans. Algorithms.
[14] Walter Stromquist,et al. Envy-Free Cake Divisions Cannot be Found by Finite Protocols , 2008, Electron. J. Comb..
[15] Vittorio Bilò,et al. Almost Envy-Free Allocations with Connected Bundles , 2018, ITCS.
[16] Dominik Peters,et al. Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints , 2018, AAAI.
[17] Ning Chen,et al. Optimal Proportional Cake Cutting with Connected Pieces , 2012, AAAI.
[18] Xiaohui Bei,et al. Dividing a Graphical Cake , 2019, AAAI.
[19] Ariel D. Procaccia,et al. Towards More Expressive Cake Cutting , 2011, IJCAI.
[20] Kathryn L. Nyman,et al. Discrete Envy-free Division of Necklaces and Maps , 2015, 1510.02132.
[21] Simina Brânzei,et al. A Dictatorship Theorem for Cake Cutting , 2015, IJCAI.
[22] Haris Aziz,et al. A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[23] Avinatan Hassidim,et al. Computing socially-efficient cake divisions , 2012, AAMAS.
[24] Edith Elkind,et al. Fair Division of a Graph , 2017, IJCAI.
[25] Javier Marenco,et al. Envy-free division of discrete cakes , 2014, Discret. Appl. Math..
[26] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2019, ACM Trans. Economics and Comput..
[27] Ayumi Igarashi,et al. Fair Division of Time: Multi-layered Cake Cutting , 2020, IJCAI.
[28] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[29] Tim Roughgarden,et al. Almost Envy-Freeness with General Valuations , 2017, SODA.
[30] Xiaohui Bei,et al. Truthful fair division without free disposal , 2018, Social Choice and Welfare.
[31] Ariel D. Procaccia. Cake Cutting Algorithms , 2016, Handbook of Computational Social Choice.
[32] Xiaotie Deng,et al. Algorithmic Solutions for Envy-Free Cake Cutting , 2012, Oper. Res..
[33] Kousha Etessami,et al. On the Complexity of Nash Equilibria and Other Fixed Points , 2010, SIAM J. Comput..
[34] Jack M. Robertson,et al. Cake-cutting algorithms - be fair if you can , 1998 .
[35] Katarína Cechlárová,et al. On the existence of equitable cake divisions , 2013, Inf. Sci..
[36] Mohammad Ghodsi,et al. Envy-Free Mechanisms with Minimum Number of Cuts , 2017, AAAI.
[37] W. Stromquist. How to Cut a Cake Fairly , 1980 .
[38] Paul W. Goldberg,et al. Consensus halving is PPA-complete , 2017, STOC.
[39] Troels Bjerre Lund,et al. Approximate Well-supported Nash Equilibria Below Two-thirds , 2015, Algorithmica.
[40] Kurt Mehlhorn,et al. EFX Exists for Three Agents , 2020, EC.
[41] Warut Suksompong,et al. Fairly Allocating Contiguous Blocks of Indivisible Items , 2017, SAGT.
[42] Aviad Rubinstein,et al. Settling the Complexity of Computing Approximate Two-Player Nash Equilibria , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[43] Simina Brânzei,et al. Simultaneous Cake Cutting , 2014, AAAI.
[44] Simina Brânzei,et al. Communication Complexity of Cake Cutting , 2017, EC.
[45] Barbara B. Simons,et al. A fast algorithm for single processor scheduling , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).