Groupwise Maximin Fair Allocation of Indivisible Goods
暂无分享,去创建一个
Y. Narahari | Siddharth Barman | Arpita Biswas | Sanath Kumar Krishna Murthy | Sanath Kumar Krishnamurthy | Siddharth Barman | Y. Narahari | S. K. Murthy | Arpita Biswas
[1] Eric Budish,et al. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.
[2] Mohammad Ghodsi,et al. Fair Allocation of Indivisible Goods: Improvements and Generalizations , 2017, EC.
[3] Ariel D. Procaccia,et al. Spliddit: unleashing fair division algorithms , 2015, SECO.
[4] Evangelos Markakis,et al. Approximation Algorithms for Computing Maximin Share Allocations , 2015, ICALP.
[5] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.
[6] Sylvain Bouveret,et al. Characterizing conflicts in fair division of indivisible goods using a scale of criteria , 2016, Autonomous Agents and Multi-Agent Systems.
[7] Lawrence G. Sager. Handbook of Computational Social Choice , 2015 .
[8] W. Stromquist. How to Cut a Cake Fairly , 1980 .
[9] Toby Walsh,et al. Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods , 2016, ArXiv.
[10] SaberiAmin,et al. Approximation Algorithms for Computing Maximin Share Allocations , 2017 .
[11] Ariel D. Procaccia,et al. When Can the Maximin Share Guarantee Be Guaranteed? , 2016, AAAI.
[12] C. Fisher,et al. Resource Allocation in the Public Sector: Values, Priorities and Markets in the Management of Public Services , 1998 .
[13] Edith Elkind,et al. Fair Division of a Graph , 2017, IJCAI.
[14] Siddharth Barman,et al. Approximation Algorithms for Maximin Fair Division , 2017, EC.
[15] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[16] H. Varian. Equity, Envy and Efficiency , 1974 .