Fair and Efficient Cake Division with Connected Pieces
暂无分享,去创建一个
Siddharth Barman | Eshwar Ram Arunachaleswaran | Nidhi Rathi | Rachitesh Kumar | Siddharth Barman | Rachitesh Kumar | Nidhi Rathi
[1] J. Nash. THE BARGAINING PROBLEM , 1950, Classics in Game Theory.
[2] Ariel D. Procaccia,et al. How to Cut a Cake Before the Party Ends , 2013, AAAI.
[3] Haris Aziz,et al. Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations , 2013, WINE.
[4] Walter Stromquist,et al. Envy-Free Cake Divisions Cannot be Found by Finite Protocols , 2008, Electron. J. Comb..
[5] Frits C. R. Spieksma,et al. Interval selection: applications, algorithms and lower bounds , 2002 .
[6] Ariel D. Procaccia,et al. Spliddit: unleashing fair division algorithms , 2015, SECO.
[7] Ning Chen,et al. Optimal Proportional Cake Cutting with Connected Pieces , 2012, AAAI.
[8] Ariel D. Procaccia. Cake Cutting Algorithms , 2016, Handbook of Computational Social Choice.
[9] Xiaotie Deng,et al. Algorithmic Solutions for Envy-Free Cake Cutting , 2012, Oper. Res..
[10] E. Eisenberg,et al. CONSENSUS OF SUBJECTIVE PROBABILITIES: THE PARI-MUTUEL METHOD, , 1959 .
[11] Avinatan Hassidim,et al. Computing socially-efficient cake divisions , 2012, AAMAS.
[12] Sudipto Guha,et al. Approximating the Throughput of Multiple Machines in Real-Time Scheduling , 2002, SIAM J. Comput..
[13] D. Foley. Resource allocation and the public sector , 1967 .
[14] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2019, ACM Trans. Economics and Comput..
[15] W. Stromquist. How to Cut a Cake Fairly , 1980 .
[16] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[17] SU Francisedward. RENTAL HARMONY : SPERNER ’ S LEMMA IN FAIR DIVISION , 2000 .
[18] Jack M. Robertson,et al. Cake-cutting algorithms - be fair if you can , 1998 .
[19] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[20] Marek Karpinski,et al. Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems , 1999, J. Comput. Syst. Sci..
[21] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[22] Ioannis Caragiannis,et al. The Efficiency of Fair Division , 2009, Theory of Computing Systems.
[23] 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).
[24] Erel Segal-Halevi,et al. Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal , 2015, AAMAS.
[25] Yonatan Aumann,et al. The Efficiency of Fair Division with Connected Pieces , 2010, WINE.
[26] M. Kaneko,et al. The Nash Social Welfare Function , 1979 .
[27] Ariel D. Procaccia,et al. Optimal Envy-Free Cake Cutting , 2011, AAAI.