暂无分享,去创建一个
[1] A. B. Kahn,et al. Topological sorting of large networks , 1962, CACM.
[2] H. Moulin. Fair Division in the Internet Age , 2019, Annual Review of Economics.
[3] Yair Zick,et al. On Weighted Envy-Freeness in Indivisible Item Allocation , 2020, AAMAS.
[4] H. Moulin,et al. Random Matching under Dichotomous Preferences , 2004 .
[5] M. Stephanov,et al. Random Matrices , 2005, hep-ph/0509286.
[6] Ariel D. Procaccia,et al. When Can the Maximin Share Guarantee Be Guaranteed? , 2016, AAAI.
[7] William Thomson,et al. Introduction to the Theory of Fair Allocation , 2016, Handbook of Computational Social Choice.
[8] Moshe Babaioff,et al. Fair Allocation through Competitive Equilibrium from Generic Incomes , 2019, FAT.
[9] Eric Budish,et al. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.
[10] A. C. Berry. The accuracy of the Gaussian approximation to the sum of independent variates , 1941 .
[11] Hervé Moulin,et al. Fair division and collective welfare , 2003 .
[12] Warut Suksompong,et al. Approximate maximin shares for groups of agents , 2017, Math. Soc. Sci..
[13] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[14] Harold W. Kuhn,et al. The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.
[15] Kurt Mehlhorn,et al. A Little Charity Guarantees Almost Envy-Freeness , 2019, SODA.
[16] G. V. Balakin. On Random Matrices , 1967 .
[17] Xin Huang,et al. Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items , 2019, EC.
[18] N. Wormald. Differential Equations for Random Processes and Random Graphs , 1995 .
[19] Evangelos Markakis,et al. Approximation Algorithms for Computing Maximin Share Allocations , 2015, ICALP.
[20] Richard M. Karp,et al. Maximum Matchings in Sparse Random Graphs , 1981, FOCS 1981.
[21] Ariel D. Procaccia,et al. The Computational Rise and Fall of Fairness , 2014, AAAI.
[22] Tim Roughgarden,et al. Almost Envy-Freeness with General Valuations , 2017, SODA.
[23] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.
[24] Kurt Mehlhorn,et al. EFX Exists for Three Agents , 2020, EC.
[25] Mohammad Taghi Hajiaghayi,et al. Fair Allocation of Indivisible Goods to Asymmetric Agents , 2017, AAMAS.
[26] Warut Suksompong,et al. Asymptotic existence of proportionally fair allocations , 2016, Math. Soc. Sci..
[27] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[28] Lester E. Dubins,et al. How to Cut a Cake Fairly , 1961 .
[29] Pasin Manurangsi,et al. When Do Envy-Free Allocations Exist? , 2018, AAAI.
[30] N. Wormald. The differential equation method for random graph processes and greedy algorithms , 1999 .
[31] W. Stromquist. How to Cut a Cake Fairly , 1980 .
[32] Ariel D. Procaccia,et al. Leximin Allocations in the Real World , 2015, EC.
[33] E. Markakis. Approximation Algorithms and Hardness Results for Fair Division with Indivisible Goods , 2017 .
[34] Warut Suksompong,et al. Envy-Freeness in House Allocation Problems , 2019, Math. Soc. Sci..
[35] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .
[36] Evangelos Markakis,et al. Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination , 2019, AAAI.
[37] Pasin Manurangsi,et al. Asymptotic existence of fair divisions for groups , 2017, Math. Soc. Sci..