Fair Allocation of Indivisible Goods: Improvement

References

• [1] Amanatidis G , Birmpas G , Markakis E (2016) On truthful mechanisms for maximin share allocations. Proc. 25th Internat. Joint Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 31–37.Google Scholar
• [2] Amanatidis G , Birmpas G , Christodoulou G , Markakis E (2017) Truthful allocation mechanisms without payments: Characterization and implications on fairness. Proc. 2017 ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 545–562.Google Scholar
• [3] Amanatidis G , Markakis E , Nikzad A , Saberi A (2017) Approximation algorithms for computing maximin share allocations. ACM Trans. Algorithms 13(4):52.Crossref, Google Scholar
• [4] Asadpour A , Saberi A (2007) An approximation algorithm for max-min fair allocation of indivisible goods. Proc. 39th Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 114–121.Google Scholar
• [5] Aziz H , Rauchecker G , Schryen G , Walsh T (2016) Approximation algorithms for max-min share allocations of indivisible chores and goods. Preprint, submitted April 5, https://arxiv.org/abs/1604.01435.Google Scholar
• [6] Aziz H , Rauchecker G , Schryen G , Walsh T (2017) Algorithms for max-min share fair allocation of indivisible chores. Proc. 31st AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 335–341.Google Scholar
• [7] Barman S , Krishna Murthy SK (2017) Approximation algorithms for maximin fair division. Proc. 2017 ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 647–664.Google Scholar
• [8] Bouveret S , Lemaître M (2016) Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Autonomous Agents Multi-Agent Systems 30(2):259–290.Crossref, Google Scholar
• [9] Budish E (2011) The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. J. Political Econom. 119(6):1061–1103.Crossref, Google Scholar
• [10] Dubins LE , Spanier EH (1961) How to cut a cake fairly. Amer. Math. Monthly 68(1):1–17.Crossref, Google Scholar
• [11] Epstein L , Levin A (2014) An efficient polynomial time approximation scheme for load balancing on uniformly related machines. Math. Programming 147(1–2):1–23.Crossref, Google Scholar
• [12] Farhadi A , Hajiaghayi M , Ghodsi M , Lahaie S , Pennock D , Seddighin M , Seddighin S , Yami H (2017) Fair allocation of indivisible goods to asymmetric agents. Proc. 16th Conf. Autonomous Agents Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 1535–1537.Google Scholar
• [13] Ghodsi M , Hajiaghayi M, Seddighin M, Seddighin S, Yami H (2018) Fair allocation of indivisible goods: Improvements and generalizations. Proc. 2018 ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 539–556.Google Scholar
• [14] Kurokawa D , Procaccia AD , Wang J (2018) Fair enough: Guaranteeing approximate maximin shares. J. ACM 65(2):8.Crossref, Google Scholar
• [15] Li Z , Vetta A (2018) The fair division of hereditary set systems. Internat. Conf. Web Internet Econom. (Springer, Cham, Switzerland), 297–311.Google Scholar
• [16] Lipton RJ , Markakis E , Mossel E , Saberi A (2004) On approximately fair allocations of indivisible goods. Proc. 5th ACM Conf. Electronic Commerce (Association for Computing Machinery, New York), 125–131.Google Scholar
• [17] Moulin H (2014) Cooperative Microeconomics: A Game-Theoretic Introduction , vol. 313 (Princeton University Press, Princeton, NJ).Google Scholar
• [18] Seddighin M , Saleh H , Ghodsi M (2019) Externalities and fairness. World Wide Web Conf. (Association for Computing Machinery, New York), 538–548.Google Scholar
• [19] Steinhaus H (1948) The problem of fair division. Econometrica 16(1)101–104.Google Scholar
• [20] West DB (2001) Introduction to Graph Theory, vol. 2 (Prentice Hall, Upper Saddle River, NJ).Google Scholar