7.3 节参考文献
[1] Steinhaus H. The problem of fair division[J]. Econometrica, 1948, 16: 101-104.
[2] Aziz H, Mackenzie S. A discrete and bounded envy-free cake cutting protocol for any number of agents[C]//2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2016: 416-427.
[3] Varian H R. Equity, envy, and efficiency[J]. 1973.
[4] Moulin H. Fair division in the internet age[J]. Annual Review of Economics, 2019, 11: 407-441.
[5] Aziz H, Li B, Wu X. Strategyproof and approximately maxmin fair share allocation of chores[J]. arXiv preprint arXiv:1905.08925, 2019.
[6] Suksompong W. Constraints in fair division[J]. ACM SIGecom Exchanges, 2021, 19(2): 46-61.
[7] Lang J, Rothe J. Fair division of indivisible goods[J]. Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, 2016: 493-550.
[8] Walsh T. Fair division: The computer scientist's perspective[J]. arXiv preprint arXiv:2005.04855, 2020.
[9] Aziz H, Li B, Wu X. Approximate and strategyproof maximin share allocation of chores with ordinal preferences[J]. Mathematical Programming, 2022: 1-27.
[10] Lipton R J, Markakis E, Mossel E, et al. On approximately fair allocations of indivisible goods[C]//Proceedings of the 5th ACM Conference on Electronic Commerce. 2004: 125-131.
[11] Procaccia A D. Technical perspective: An answer to fair division's most enigmatic question[J]. Communications of the ACM, 2020, 63(4): 118-118.
[12] Budish E. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes[J]. Journal of Political Economy, 2011, 119(6): 1061-1103.
[13] Kurokawa D, Procaccia A, Wang J. When can the maximin share guarantee be guaranteed?[C]//Proceedings of the AAAI Conference on Artificial Intelligence. 2016, 30(1).
[14] Kurokawa D, Procaccia A D, Wang J. Fair enough: Guaranteeing approximate maximin shares[J]. Journal of the ACM (JACM), 2018,
65(2): 1-27.
[15] Robertson J, Webb W. Cake-cutting algorithms: Be fair if you can[M]. CRC Press, 1998.
[16] Stromquist W. How to cut a cake fairly[J]. The American Mathematical Monthly, 1980, 87(8): 640-644.
[17] Aziz H, Mackenzie S. A discrete and bounded envy-free cake cutting protocol for four agents[C]//Proceedings of the forty-eighth annual ACM symposium on Theory of Computing. 2016: 454-464.
[18] Aziz H, Li B, Moulin H, et al. Algorithmic fair allocation of indivisible items: A survey and new questions[J]. ACM SIGecom Exchanges, 2022, 20(1): 24-40.
[19] Plaut B, Roughgarden T. Almost envy-freeness with general valuations[J]. SIAM Journal on Discrete Mathematics, 2020, 34(2): 1039-1068.
[20] Steven J. Brams and Alan D. Taylor. The win-win solution - guaranteeing fair shares to everybody. 2000.
[21] Bouveret S, Lang J. A general elicitation-free protocol for allocating indivisible goods[C]//Twenty-Second International Joint Conference on Artificial Intelligence. 2011.
[22] Amanatidis G, Birmpas G, Markakis E. On truthful mechanisms for maximin share allocations[J]. arXiv preprint arXiv:1605.04026, 2016.
[23] Bei X, Lu X, Manurangsi P, et al. The price of fairness for indivisible goods[J]. Theory of Computing Systems, 2021, 65: 1069-1093.
[24] Garg J, McGlaughlin P, Taki S. Approximating maximin share allocations[J]. Open access series in informatics, 2019, 69.
[25] Garg J, Taki S. An improved approximation algorithm for maximin
shares[C]//Proceedings of the 21st ACM Conference on Economics and Computation. 2020: 379-380.
[26] Amanatidis G, Markakis E, Nikzad A, et al. Approximation algorithms for computing maximin share allocations[J]. ACM Transactions on Algorithms (TALG), 2017, 13(4): 1-28.
[27] Barman S, Krishnamurthy S K. Approximation algorithms for maximin fair division[J]. ACM Transactions on Economics and Computation (TEAC), 2020, 8(1): 1-28.
[28] Caragiannis I, Kurokawa D, Moulin H, et al. The unreasonable fairness of maximum Nash welfare[J]. ACM Transactions on Economics and Computation (TEAC), 2019, 7(3): 1-32.