暂无分享,去创建一个
[1] H. Peyton Young,et al. Equity - in theory and practice , 1994 .
[2] F. Su. Rental Harmony: Sperner's Lemma in Fair Division , 1999 .
[3] Mohammad Ghodsi,et al. Fair Allocation of Indivisible Goods: Improvements and Generalizations , 2017, EC.
[4] Flip Klijn,et al. An algorithm for envy-free allocations in an economy with indivisible objects and money , 2000, Soc. Choice Welf..
[5] Rohit Vaish,et al. On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources , 2020, APPROX-RANDOM.
[6] Adrian Vetta,et al. One Dollar Each Eliminates Envy , 2019, EC.
[7] Bo Li,et al. Weighted Maxmin Fair Share Allocation of Indivisible Chores , 2019, IJCAI.
[8] Mohammad Suyanto. Electronic commerce (EC) , 2010 .
[9] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[10] Nisarg Shah,et al. Fair Division with Subsidy , 2019, SAGT.
[11] Jugal Garg,et al. An Improved Approximation Algorithm for Maximin Shares , 2019, EC.
[12] Vincent Conitzer,et al. Handbook of Computational Social Choice , 2016 .
[13] W. Stromquist. How to Cut a Cake Fairly , 1980 .
[14] Hans Reijnierse,et al. Envy-free and Pareto efficient allocations in economies with indivisible goods and money , 2002, Math. Soc. Sci..
[15] D. Foley. Resource allocation and the public sector , 1967 .
[16] Siddharth Barman,et al. Approximation Algorithms for Maximin Fair Division , 2017, EC.
[17] Miroslaw Truszczynski,et al. Maximin Share Allocations on Cycles , 2020, J. Artif. Intell. Res..
[18] Hervé Moulin,et al. Competitive Division of a Mixed Manna , 2017, ArXiv.
[19] Eric Budish. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2011, Journal of Political Economy.
[20] Haris Aziz,et al. Achieving Envy-freeness and Equitability with Monetary Transfers , 2020, AAAI.
[21] Yann Chevaleyre,et al. Fair Allocation of Indivisible Goods , 2016, Handbook of Computational Social Choice.
[22] Jérôme Monnot,et al. On maximin share allocations in matroids , 2019, Theor. Comput. Sci..
[23] Toby Walsh,et al. Fair allocation of indivisible goods and chores , 2019, Autonomous Agents and Multi-Agent Systems.
[24] Mohammad Taghi Hajiaghayi,et al. Fair Allocation of Indivisible Goods to Asymmetric Agents , 2017, AAMAS.
[25] Evangelos Markakis,et al. Comparing Approximate Relaxations of Envy-Freeness , 2018, IJCAI.
[26] Evangelos Markakis,et al. Approximation Algorithms for Computing Maximin Share Allocations , 2015, ICALP.
[27] Ariel D. Procaccia,et al. Spliddit: unleashing fair division algorithms , 2015, SECO.
[28] George R. Feiwel,et al. Arrow and the foundations of the theory of economic policy , 1987 .
[29] H. Moulin. Fair Division in the Internet Age , 2019, Annual Review of Economics.
[30] Dominik Peters,et al. Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints , 2018, AAAI.
[31] Ioannis Caragiannis,et al. Computing envy-freeable allocations with limited subsidies , 2020, ArXiv.
[32] Xin Huang,et al. An Algorithmic Framework for Approximating Maximin Share Allocation of Chores , 2019, EC.
[33] Miroslaw Truszczynski,et al. Maximin Share Allocations on Cycles , 2018, IJCAI.
[34] Mohammad Ghodsi,et al. Fair Allocation of Indivisible Goods: Improvement , 2021, Math. Oper. Res..
[35] Ya'akov Gal,et al. Which is the fairest (rent division) of them all? , 2017, IJCAI.
[36] Gerhard J. Woeginger,et al. A polynomial-time approximation scheme for maximizing the minimum machine completion time , 1997, Oper. Res. Lett..
[37] Bo Li,et al. Strategyproof and Approximately Maxmin Fair Share Allocation of Chores , 2019, IJCAI.
[38] D. Gale,et al. Fair Allocation of Indivisible Goods and Criteria of Justice , 1991 .
[39] Matthias G. Raith,et al. Bidding for envy-freeness: A procedural approach to n-player fair-division problems , 2002, Soc. Choice Welf..
[40] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.
[41] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2019, ACM Trans. Economics and Comput..
[42] Ruta Mehta,et al. Competitive Allocation of a Mixed Manna , 2020, SODA.
[43] Xiaohui Bei,et al. Fair Division of Mixed Divisible and Indivisible Goods , 2019, AAAI.
[44] 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).
[45] Steven J. Brams,et al. Mathematics and democracy: Designing better voting and fair-division procedures , 2008, Math. Comput. Model..
[46] Toby Walsh,et al. Algorithms for Max-Min Share Fair Allocation of Indivisible Chores , 2017, AAAI.
[47] Eric Maskin. On the Fair Allocation of Indivisible Goods , 1987 .
[48] H. Steinhaus,et al. Sur la division pragmatique , 1949 .
[49] Jugal Garg,et al. Approximating Maximin Share Allocations , 2019, SOSA.
[50] Edith Elkind,et al. Fair Division of a Graph , 2017, IJCAI.
[51] Tamás Fleiner,et al. The Complexity of Cake Cutting with Unequal Shares , 2017, SAGT.
[52] Y. Narahari,et al. Groupwise Maximin Fair Allocation of Indivisible Goods , 2017, AAAI.
[53] Siddharth Barman,et al. Fully Polynomial-Time Approximation Schemes for Fair Rent Division , 2018, SODA.
[54] Lester E. Dubins,et al. How to Cut a Cake Fairly , 1961 .
[55] Tayfun Sönmez,et al. Room assignment-rent division: A market approach , 2004, Soc. Choice Welf..
[56] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[57] Warut Suksompong,et al. Approximate maximin shares for groups of agents , 2017, Math. Soc. Sci..
[58] Shimon Even,et al. A note on cake cutting , 1984, Discret. Appl. Math..
[59] Sylvain Bouveret,et al. Characterizing conflicts in fair division of indivisible goods using a scale of criteria , 2016, Autonomous Agents and Multi-Agent Systems.