暂无分享,去创建一个
[1] Evangelos Markakis,et al. Approximation Algorithms for Computing Maximin Share Allocations , 2015, ICALP.
[2] Mohammad Ghodsi,et al. Fair Allocation of Indivisible Goods: Improvements and Generalizations , 2017, EC.
[3] Ariel D. Procaccia,et al. Fair enough: guaranteeing approximate maximin shares , 2014, EC.
[4] C. Fisher,et al. Resource Allocation in the Public Sector: Values, Priorities and Markets in the Management of Public Services , 1998 .
[5] Edith Elkind,et al. Fair Division of a Graph , 2017, IJCAI.
[6] Harold N. Gabow,et al. Forests, frames, and games: Algorithms for matroid sums and applications , 1992, STOC '88.
[7] Jérôme Monnot,et al. Near Fairness in Matroids , 2014, ECAI.
[8] H. Moulin. Uniform externalities: Two axioms for fair allocation , 1990 .
[9] Y. Narahari,et al. Groupwise Maximin Fair Allocation of Indivisible Goods , 2017, AAAI.
[10] Jérôme Monnot,et al. Approximate Maximin Share Allocations in Matroids , 2017, CIAC.
[11] M. V. Iersel. EC , 2019, Springer Reference Medizin.
[12] Siddharth Barman,et al. Approximation Algorithms for Maximin Fair Division , 2017, EC.
[13] Ariel D. Procaccia,et al. When Can the Maximin Share Guarantee Be Guaranteed? , 2016, AAAI.
[14] Lawrence G. Sager. Handbook of Computational Social Choice , 2015 .
[15] John Sallis. Frames , 2020, Comparative and Continental Philosophy.
[16] Moshe Babaioff,et al. Proceedings of the 2017 ACM Conference on Economics and Computation , 2017, EC.
[17] Evangelos Markakis,et al. Approximation Algorithms for Computing Maximin Share Allocations , 2015, ICALP.
[18] Ariel D. Procaccia,et al. Spliddit: unleashing fair division algorithms , 2015, SECO.
[19] Joan Feigenbaum,et al. Proceedings of the 5th ACM conference on Electronic commerce , 2004 .
[20] Jérôme Monnot,et al. On regular and approximately fair allocations of indivisible goods , 2014, AAMAS.
[21] G. Myles. Journal of Economic Theory: J.-M. Grandmont, 1992, Transformations of the commodity space, behavioural heterogeneity, and the aggregation problem 57, 1-35 , 1993 .
[22] Eric Budish. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2011, Journal of Political Economy.
[23] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[24] W. Stromquist. How to Cut a Cake Fairly , 1980 .
[25] Sylvain Bouveret,et al. Characterizing conflicts in fair division of indivisible goods using a scale of criteria , 2016, Autonomous Agents and Multi-Agent Systems.
[26] H. Varian. Equity, Envy and Efficiency , 1974 .
[27] Vincent Conitzer,et al. Proceedings of the 2016 ACM Conference on Economics and Computation , 2016, EC.
[28] Daniel J. Velleman. American Mathematical Monthly , 2010 .
[29] Judd B. Kessler,et al. Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation , 2015, Oper. Res..
[30] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.
[31] Harold N. Gabow,et al. Forests, frames, and games: algorithms for matroid sums and applications , 1988, STOC '88.