{"type":"ScholarlyArticle","title":"The Price of Fairness for Indivisible Goods","authors":[{"name":"Xiaohui Bei","slug":"xiaohui-bei","given":"Xiaohui","family":"Bei","affiliation":"School of Physical and Mathematical Sciences , Nanyang Technological University"},{"name":"Xinhang Lu","slug":"xinhang-lu","given":"Xinhang","family":"Lu","affiliation":"School of Physical and Mathematical Sciences , Nanyang Technological University"},{"name":"Pasin Manurangsi","slug":"pasin-manurangsi","given":"Pasin","family":"Manurangsi","affiliation":"Department of Electrical Engineering and Computer Sciences , UC Berkeley"},{"name":"Warut Suksompong","slug":"warut-suksompong","given":"Warut","family":"Suksompong","affiliation":"Department of Computer Science , University of Oxford"}],"abstract":"We investigate the efficiency of fair allocations of indivisible goods using the well-studied price of fairness concept. Previous work has focused on classical fairness notions such as envy-freeness, proportionality, and equitability. However, these notions cannot always be satisfied for indivisible goods, leading to certain instances being ignored in the analysis. In this paper, we focus instead on notions with guaranteed existence, including envy-freeness up to one good (EF1), balancedness, maximum Nash welfare (MNW), and leximin. We mostly provide tight or asymptotically tight bounds on the worst-case efficiency loss for allocations satisfying these notions.","doi":"10.24963/ijcai.2019/12","url":"https://ijcai.org/proceedings/2019/12","pdf":"https://ijcai.org/proceedings/2019/0012.pdf","markdown":"https://ijcai.org/proceedings/2019/12.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/12","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":12,"pages":{"first":81,"last":87},"keywords":["Agent-based and Multi-agent Systems: Resource Allocation","Agent-based and Multi-agent Systems: Algorithmic Game Theory","Agent-based and Multi-agent Systems: Computational Social Choice"],"videos":[],"references":[{"position":1,"raw":"[Aumann and Dombb, 2015] Yonatan Aumann and Yair Dombb. The efficiency of fair division with connected pieces. ACM Transactions on Economics and Computa- tion, 3(4):23, 2015.","title":"Yonatan Aumann and Yair Dombb. The efficiency of fair division with connected pieces","authors":"Dombb Aumann","year":"2015","venue":"ACM Transactions on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bansal and Sviridenko, 2006] Nikhil Bansal and Maxim Sviridenko. The Santa Claus problem. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pages 31-40, 2006.","title":"The Santa Claus problem","authors":"Nikhil Bansal, Maxim Sviridenko","year":"2006","venue":"Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bei et al., 2019] Xiaohui Bei, Xinhang Lu, Pasin Manu- rangsi, and Warut Suksompong. The price of fairness for indivisible goods. CoRR, abs/1905.04910, 2019.","title":"The price of fairness for indivisible goods","authors":"Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, Warut Suksompong","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bertsimas et al., 2011] Dimitris Bertsimas, Vivek F. Farias, and Nikolaos Trichakis. The price of fairness. Operations Research, 59(1):17-31, 2011.","title":"The price of fairness","authors":"Dimitris Bertsimas, F Vivek, Nikolaos Farias, Trichakis","year":"2011","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bezáková and Dani, 2005] Ivona Bezáková and Varsha Dani. Allocating indivisible goods. ACM SIGecom Ex- changes, 5(3):11-18, 2005.","title":"Ivona Bezáková and Varsha Dani. Allocating indivisible goods","authors":"Dani Bezáková","year":"2005","venue":"ACM SIGecom Exchanges","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bilò et al., 2016] Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, and Luca Moscardelli. The price of envy-freeness in machine scheduling. Theoretical Computer Science, 613:65-78, 2016.","title":"The price of envy-freeness in machine scheduling","authors":"Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli","year":"2016","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Biswas and Barman, 2018] Arpita Biswas and Siddharth Barman. Fair division under cardinality constraints. In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), pages 91-97, 2018.","title":"Fair division under cardinality constraints","authors":"Arpita Biswas, Siddharth Barman","year":"2018","venue":"Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2018/13"},{"position":8,"raw":"[Bogomolnaia and Moulin, 2004] Anna Bogomolnaia and Hervé Moulin. Random matching under dichotomous preferences. Econometrica, 72(1):257-279, 2004.","title":"Random matching under dichotomous preferences","authors":"Anna Bogomolnaia, Hervé Moulin","year":"2004","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Caragiannis et al., 2012] Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Maria Ky- ropoulou. The efficiency of fair division. Theory of Computing Systems, 50(4):589-610, 2012.","title":"The efficiency of fair division","authors":"Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria","year":"2012","venue":"Theory of Computing Systems","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Caragiannis et al., 2016] Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, and Junxing Wang. The unreasonable fairness of maximum Nash welfare. In Proceedings of the 17th ACM Conference on Economics and Computation (EC), pages 305-322, 2016.","title":"The unreasonable fairness of maximum Nash welfare","authors":"Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D Procaccia, Nisarg Shah, Junxing Wang","year":"2016","venue":"Proceedings of the 17th ACM Conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Dickerson et al., 2014] John P. Dickerson, Jonathan Gold- man, Jeremy Karp, Ariel D. Procaccia, and Tuomas Sand- holm. The computational rise and fall of fairness. In Pro- ceedings of the 28th AAAI Conference on Artificial Intelli- gence (AAAI), pages 1405-1411, 2014.","title":"The computational rise and fall of fairness","authors":"John P Dickerson, Jonathan Goldman, Jeremy Karp, Ariel D Procaccia, Tuomas Sandholm","year":"2014","venue":"Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Dubins and Spanier, 1961] Lester E. Dubins and Edwin H. Spanier. How to cut a cake fairly. The American Mathe- matical Monthly, 68(1):1-17, 1961.","title":"How to cut a cake fairly","authors":"Lester E Dubins, Edwin H Spanier","year":"1961","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Heydrich and van Stee, 2015] Sandy Heydrich and Rob van Stee. Dividing connected chores fairly. Theoretical Com- puter Science, 593:51-61, 2015.","title":"Sandy Heydrich and Rob van Stee. Dividing connected chores fairly","authors":"Van Heydrich, Stee","year":"2015","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kurokawa et al., 2015] David Kurokawa, Ariel D. Procac- cia, and Nisarg Shah. Leximin allocations in the real world. In Proceedings of the 16th ACM Conference on Economics and Computation (EC), pages 345-362, 2015.","title":"Leximin allocations in the real world","authors":"David Kurokawa, Ariel D Procaccia, Nisarg Shah","year":"2015","venue":"Proceedings of the 16th ACM Conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Kurz, 2014] Sascha Kurz. The price of fairness for a small number of indivisible items. In Operations Research Pro- ceedings, pages 335-340, 2014.","title":"The price of fairness for a small number of indivisible items","authors":"Sascha Kurz, Kurz","year":"2014","venue":"Operations Research Proceedings","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Lipton et al., 2004] Richard J. Lipton, Evangelos Markakis, Elchanan Mossel, and Amin Saberi. On approximately fair allocations of indivisible goods. In Proceedings of the 5th ACM Conference on Electronic Commerce (EC), pages 125-131, 2004.","title":"On approximately fair allocations of indivisible goods","authors":"Richard J Lipton, Evangelos Markakis, Elchanan Mossel, Amin Saberi","year":"2004","venue":"Proceedings of the 5th ACM Conference on Electronic Commerce (EC)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Manurangsi and Suksompong, 2019] Pasin Manurangsi and Warut Suksompong. When do envy-free allocations exist? In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI), 2019. Forthcoming.","title":"Pasin Manurangsi and Warut Suksompong. When do envy-free allocations exist","authors":"Suksompong Manurangsi","year":"2019","venue":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Plaut and Roughgarden, 2018] Benjamin Plaut and Tim Roughgarden. Almost envy-freeness with general valu- ations. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2584- 2603, 2018.","title":"Almost envy-freeness with general valuations","authors":"Benjamin Plaut, Tim Roughgarden","year":"2018","venue":"Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Steinhaus, 1948] Hugo Steinhaus. The problem of fair divi- sion. Econometrica, 16(1):101-104, 1948.","title":"Hugo Steinhaus. The problem of fair division","authors":"Steinhaus","year":"1948","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Suksompong, 2019] Warut Suksompong. Fairly allocating contiguous blocks of indivisible items. Discrete Applied Mathematics, 260:227-236, 2019.","title":"Warut Suksompong. Fairly allocating contiguous blocks of indivisible items","authors":"Suksompong","year":"2019","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}