{"type":"ScholarlyArticle","title":"Fairly Allocating Goods and (Terrible) Chores","authors":[{"name":"Hadi Hosseini","slug":"hadi-hosseini","given":"Hadi","family":"Hosseini","affiliation":"Pennsylvania State University"},{"name":"Aghaheybat Mammadov","slug":"aghaheybat-mammadov","given":"Aghaheybat","family":"Mammadov","affiliation":"Pennsylvania State University"},{"name":"Tomasz Wąs","slug":"tomasz-was","given":"Tomasz","family":"Wąs","affiliation":"Pennsylvania State University"}],"abstract":"We study the fair allocation of mixture of indivisible goods and chores under lexicographic preferences---a subdomain of additive preferences. A prominent fairness notion for allocating indivisible items is envy-freeness up to any item (EFX). Yet, its existence and computation has remained a notable open problem. By identifying a class of instances with \"terrible chores\", we  show that determining the existence of an EFX allocation is NP-complete. This result immediately implies the intractability of EFX under additive preferences. Nonetheless, we propose a natural subclass of lexicographic preferences for which an EFX and Pareto optimal (PO) allocation is guaranteed to exist and can be computed efficiently for any mixed instance. Focusing on two weaker fairness notions, we investigate finding EF1 and Pareto optimal allocations for special instances with terrible chores, and show that MMS and PO allocations can be computed efficiently for any mixed instance with lexicographic preferences.","doi":"10.24963/ijcai.2023/305","url":"https://ijcai.org/proceedings/2023/305","pdf":"https://ijcai.org/proceedings/2023/0305.pdf","markdown":"https://ijcai.org/proceedings/2023/305.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/305","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Game Theory and Economic Paradigms","track":"Main Track","number":305,"pages":{"first":2738,"last":2746},"keywords":["Game Theory and Economic Paradigms: GTEP: Computational social choice","Game Theory and Economic Paradigms: GTEP: Fair division"],"videos":[],"references":[{"position":1,"raw":"[Aleksandrov et al., 2015] Martin Aleksandrov, Haris Aziz, Serge Gaspers, and Toby Walsh. Online fair division: analysing a food bank problem. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, pages 2540-2546, 2015.","title":"Online fair division: analysing a food bank problem","authors":"Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh","year":"2015","venue":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2015/360"},{"position":2,"raw":"[Amanatidis et al., 2021] Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, and Alexandros A Voudouris. Maximum Nash welfare and other stories about EFX. Theoretical Computer Science, 863:69-85, 2021.","title":"Maximum Nash welfare and other stories about EFX","authors":"Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A Voudouris","year":"2021","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":"/proceedings/2020/4"},{"position":3,"raw":"[Aziz and Brandl, 2021] Haris Aziz and Florian Brandl. Ef- ficient, fair, and incentive-compatible healthcare rationing. In Proceedings of the 22nd ACM Conference on Eco- nomics and Computation, pages 103-104, 2021.","title":"Efficient, fair, and incentive-compatible healthcare rationing","authors":"Haris Aziz, Florian Brandl","year":"2021","venue":"Proceedings of the 22nd ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Aziz et al., 2017] Haris Aziz, Gerhard Rauchecker, Guido Schryen, and Toby Walsh. Algorithms for max-min share fair allocation of indivisible chores. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, page 335-341, 2017.","title":"Algorithms for max-min share fair allocation of indivisible chores","authors":"Haris Aziz, Gerhard Rauchecker, Guido Schryen, Toby Walsh","year":"2017","venue":"Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Aziz et al., 2022] Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, and Toby Walsh. Fair allocation of indivisible goods and chores. Autonomous Agents and Multi-Agent Systems, 36(1):1-21, 2022.","title":"Fair allocation of indivisible goods and chores","authors":"Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, Toby Walsh","year":"2022","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":"/proceedings/2019/8"},{"position":6,"raw":"[Aziz et al., 2023] Haris Aziz, Jeremy Lindsay, Angus Ri- tossa, and Mashbat Suzuki. Fair allocation of two types of chores. In Proceedings of the 22nd International Con- ference on Autonomous Agents and MultiAgent Systems, 2023. forthcoming.","title":"Fair allocation of two types of chores","authors":"Haris Aziz, Jeremy Lindsay, Angus Ritossa, Mashbat Suzuki","year":"2023","venue":"Proceedings of the 22nd International Conference on Autonomous Agents and MultiAgent Systems","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Babaioff et al., 2019] Moshe Babaioff, Noam Nisan, and Inbal Talgam-Cohen. Fair allocation through competitive equilibrium from generic incomes. In Proceedings of the 2019 ACM Conference on Fairness, Accountability and Transparency, pages 180-180, 2019.","title":"Fair allocation through competitive equilibrium from generic incomes","authors":"Babaioff","year":"2019","venue":"Proceedings of the 2019 ACM Conference on Fairness, Accountability and Transparency","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Babaioff et al., 2021] Moshe Babaioff, Tomer Ezra, and Uriel Feige. Fair and truthful mechanisms for dichotomous valuations. In Proceedings of the 35th AAAI Conference on Artificial Intelligence, volume 35, pages 5119-5126, 2021.","title":"Fair and truthful mechanisms for dichotomous valuations","authors":"Babaioff","year":"2021","venue":"Proceedings of the 35th AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Barman et al., 2018] Siddharth Barman, Sanath Kumar Kr- ishnamurthy, and Rohit Vaish. Finding fair and efficient allocations. In Proceedings of the 2018 ACM Conference on Economics and Computation, pages 557-574, 2018.","title":"Finding fair and efficient allocations","authors":"Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish","year":"2018","venue":"Proceedings of the 2018 ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bérczi and Gedefa Tolessa, 2022] Kristóf Bérczi and Fekadu Gedefa Tolessa. A note on the existence of EFX allocations for negative additive valuations. Technical Report QP-2022-01, Egerváry Research Group, Budapest, 2022. egres.elte.hu.","title":"A note on the existence of EFX allocations for negative additive valuations","authors":"Kristóf Bérczi, Fekadu Gedefa, Tolessa","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bérczi et al., 2020] Kristóf Bérczi, Erika R Bérczi- Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, and Kazuhisa Makino. Envy-free relaxations for goods, chores, and mixed items. arXiv preprint arXiv:2006.04428, 2020.","title":"Envy-free relaxations for goods, chores, and mixed items","authors":"Kristóf Bérczi, Erika R Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Bhaskar et al., 2021] Umang Bhaskar, AR Sricharan, and Rohit Vaish. On approximate envy-freeness for indivisible chores and mixed resources. In Proceedings of the 24th In- ternational Conference on Approximation Algorithms for Combinatorial Optimization Problems, 2021.","title":"On approximate envy-freeness for indivisible chores and mixed resources","authors":"Umang Bhaskar, Rohit Sricharan, Vaish","year":"2021","venue":"Proceedings of the 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Budish, 2011] Eric Budish. The combinatorial assign- ment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy, 119(6):1061-1103, 2011.","title":"The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes","authors":"Eric Budish","year":"2011","venue":"Journal of Political Economy","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Caragiannis et al., 2019] Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D Procaccia, Nisarg Shah, and Junxing Wang. The unreasonable fairness of maximum Nash welfare. ACM Transactions on Economics and Computation, 7(3):12, 2019.","title":"The unreasonable fairness of maximum Nash welfare","authors":"Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D Procaccia, Nisarg Shah, Junxing Wang","year":"2019","venue":"ACM Transactions on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Chaudhury et al., 2020] Bhaskar Ray Chaudhury, Jugal Garg, and Kurt Mehlhorn. EFX exists for three agents. In Proceedings of the 21st ACM Conference on Economics and Computation, pages 1-19, 2020.","title":"EFX exists for three agents","authors":"Ray Bhaskar, Jugal Chaudhury, Kurt Garg, Mehlhorn","year":"2020","venue":"Proceedings of the 21st ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Chen and Liu, 2020] Xingyu Chen and Zijie Liu. The fair- ness of leximin in allocation of indivisible chores. arXiv preprint arXiv:2005.04864, 2020.","title":"The fairness of leximin in allocation of indivisible chores","authors":"Chen, Liu, Xingyu Chen, Zijie Liu","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Ebadian et al., 2022] Soroush Ebadian, Dominik Peters, and Nisarg Shah. How to fairly allocate easy and diffi- cult chores. In Proceedings of the 21st International Con- ference on Autonomous Agents and MultiAgent Systems, pages 372-380, 2022.","title":"How to fairly allocate easy and difficult chores","authors":"Dominik Soroush Ebadian, Nisarg Peters, Shah","year":"2022","venue":"Proceedings of the 21st International Conference on Autonomous Agents and MultiAgent Systems","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Foley, 1967] Duncan K. Foley. Resource allocation and the public sector. Yale Economic Essays, 7:45-98, 1967.","title":"Resource allocation and the public sector","authors":"Duncan K Foley","year":"1967","venue":"Yale Economic Essays","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Gamow and Stern, 1958] George Gamow and Marvin Stern. Puzzle math. Viking, New York, 1958.","title":"George Gamow and Marvin Stern","authors":"Stern Gamow","year":"1958","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Garg and Murhekar, 2021] Jugal Garg and Aniket Murhekar. Computing fair and efficient allocations with few utility values. In Proceedings of the 14th International Symposium on Algorithmic Game Theory, pages 345-359. Springer, 2021.","title":"Computing fair and efficient allocations with few utility values","authors":"Jugal Garg, Aniket Murhekar","year":"2021","venue":"Proceedings of the 14th International Symposium on Algorithmic Game Theory","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Garg and Taki, 2021] Jugal Garg and Setareh Taki. An im- proved approximation algorithm for maximin shares. Ar- tificial Intelligence, 300:103547, 2021.","title":"An improved approximation algorithm for maximin shares","authors":"Taki Garg, Jugal Garg, Setareh Taki","year":"2021","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Garg et al., 2022] Jugal Garg, Aniket Murhekar, and John Qin. Fair and efficient allocations of chores under bival- ued preferences. Proceedings of the AAAI Conference on Artificial Intelligence, 36(5):5043-5050, 2022.","title":"Fair and efficient allocations of chores under bivalued preferences","authors":"Jugal Garg, Aniket Murhekar, John Qin","year":"2022","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Ghodsi et al., 2021] Mohammad Ghodsi, Moham- mad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, and Hadi Yami. Fair allocation of indivis- ible goods: Improvement. Mathematics of Operations Research, 46(3):1038-1053, 2021.","title":"Fair allocation of indivisible goods: Improvement","authors":"Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami","year":"2021","venue":"Mathematics of Operations Research","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Goldberg et al., 2023] Paul W. Goldberg, Kasper Høgh, and Alexandros Hollender. The frontier of intractability for EFX with two agents. arXiv preprint arXiv:2301.10354, 2023.","title":"The frontier of intractability for EFX with two agents","authors":"Paul W Goldberg, Kasper Høgh, Alexandros Hollender","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Halpern et al., 2020] Daniel Halpern, Ariel D Procaccia, Alexandros Psomas, and Nisarg Shah. Fair division with binary valuations: One rule to rule them all. In Proceed- ings of the 16th International Conference on Web and In- ternet Economics, pages 370-383. Springer, 2020.","title":"Fair division with binary valuations: One rule to rule them all","authors":"Daniel Halpern, Ariel D Procaccia, Alexandros Psomas, Nisarg Shah","year":"2020","venue":"Proceedings of the 16th International Conference on Web and Internet Economics","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Hosseini and Larson, 2019] Hadi Hosseini and Kate Lar- son. Multiple assignment problems under lexicographic preferences. In Proceedings of the 18th International Con- ference on Autonomous Agents and MultiAgent Systems, pages 837-845, 2019.","title":"Multiple assignment problems under lexicographic preferences","authors":"Hadi Hosseini, Kate Larson","year":"2019","venue":"Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Hosseini et al., 2021] Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, and Lirong Xia. Fair and efficient allocations un- der lexicographic preferences. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, pages 5472-5480, 2021.","title":"Fair and efficient allocations under lexicographic preferences","authors":"Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Lirong Xia","year":"2021","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Hosseini et al., 2022a] Hadi Hosseini, Andrew Searns, and Erel Segal-Halevi. Ordinal maximin share approximation for chores. In Proceedings of the 21st International Con- ference on Autonomous Agents and Multiagent Systems, pages 597-605, 2022.","title":"Ordinal maximin share approximation for chores","authors":"Hosseini","year":"2022","venue":"Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Hosseini et al., 2022b] Hadi Hosseini, Andrew Searns, and Erel Segal-Halevi. Ordinal maximin share approxima- tion for goods. Journal of Artificial Intelligence Research, 74:353-391, 2022.","title":"Ordinal maximin share approximation for goods","authors":"Hosseini","year":"2022","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Hosseini et al., 2023a] Hadi Hosseini, Aghaheybat Mam- madov, and Tomasz W ąs. Fairly allocating goods and (ter- rible) chores. arXiv preprint arXiv:2305.01786, 2023.","title":"Aghaheybat Mammadov, and Tomasz W ąs. Fairly allocating goods and (terrible) chores","authors":"Hosseini","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Hosseini et al., 2023b] Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, and Lirong Xia. Fairly dividing mixtures of goods and chores under lexicographic preferences. In Proceed- ings of the 22nd International Conference on Autonomous Agents and MultiAgent Systems, 2023. forthcoming.","title":"Fairly dividing mixtures of goods and chores under lexicographic preferences","authors":"Hosseini","year":"2023","venue":"Proceedings of the 22nd International Conference on Autonomous Agents and MultiAgent Systems","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Johnson and Garey, 1979] David S Johnson and Michael R Garey. Computers and intractability: A guide to the theory of NP-completeness. WH Freeman, 1979.","title":"Computers and intractability: A guide to the theory of NP-completeness","authors":"S David, Michael R Johnson, Garey","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Kulkarni et al., 2021] Rucha Kulkarni, Ruta Mehta, and Setareh Taki. Indivisible mixed manna: On the com- putability of MMS+PO allocations. In Proceedings of the 22nd ACM Conference on Economics and Computation, pages 683-684, 2021.","title":"Indivisible mixed manna: On the computability of MMS+PO allocations","authors":"Rucha Kulkarni, Ruta Mehta, Setareh Taki","year":"2021","venue":"Proceedings of the 22nd ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Kurokawa et al., 2018] David Kurokawa, Ariel D Procac- cia, and Junxing Wang. Fair enough: Guaranteeing ap- proximate maximin shares. Journal of the ACM, 65(2):1- 27, 2018.","title":"Fair enough: Guaranteeing approximate maximin shares","authors":"David Kurokawa, Ariel D Procaccia, Junxing Wang","year":"2018","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Lang et al., 2018] Jérôme Lang, Jérôme Mengin, and Lirong Xia. Voting on multi-issue domains with condi- tionally lexicographic preferences. Artificial Intelligence, 265:18-44, 2018.","title":"Voting on multi-issue domains with conditionally lexicographic preferences","authors":"Jérôme Lang, Jérôme Mengin, Lirong Xia","year":"2018","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":36,"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, pages 125- 131, 2004.","title":"On approximately fair allocations of indivisible goods","authors":"Evangelos Richard J Lipton, Elchanan Markakis, Amin Mossel, Saberi","year":"2004","venue":"Proceedings of the 5th ACM Conference on Electronic Commerce","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Mahara, 2021] Ryoga Mahara. Extension of additive valu- ations to general valuations on the existence of EFX. In 29th Annual European Symposium on Algorithms, volume 204, pages 66:1-66:15, 2021.","title":"Extension of additive valuations to general valuations on the existence of EFX","authors":"Mahara","year":"2021","venue":"29th Annual European Symposium on Algorithms","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Nguyen and Rothe, 2023] Trung Thanh Nguyen and Jörg Rothe. Fair and efficient allocation with few agent types, few item types, or small value levels. Artificial Intelli- gence, 314:103820, 2023.","title":"Fair and efficient allocation with few agent types, few item types, or small value levels","authors":"Rothe Nguyen, Thanh Nguyen, Jörg Rothe","year":"2023","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Nguyen, 2020] Trung Thanh Nguyen. How to fairly allocate indivisible resources among agents having lexicographic subadditive utilities. In Frontiers in Intelligent Computing: Theory and Applications, pages 156-166. Springer, 2020.","title":"How to fairly allocate indivisible resources among agents having lexicographic subadditive utilities","authors":"Thanh Trung, Nguyen","year":"2020","venue":"Frontiers in Intelligent Computing: Theory and Applications","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Pathak et al., 2021] Parag A Pathak, Tayfun Sönmez, M Utku Ünver, and M Bumin Yenmez. Fair allocation of vaccines, ventilators and antiviral treatments: Leaving no ethical value behind in health care rationing. In Pro- ceedings of the 22nd ACM Conference on Economics and Computation, pages 785-786, 2021.","title":"Fair allocation of vaccines, ventilators and antiviral treatments: Leaving no ethical value behind in health care rationing","authors":"A Parag, Tayfun Pathak, M Sönmez, M Utku Ünver, Yenmez Bumin","year":"2021","venue":"Proceedings of the 22nd ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Payan and Zick, 2022] Justin Payan and Yair Zick. I will have order! Optimizing orders for fair reviewer assign- ment. In Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, pages 1711-1713, 2022.","title":"I will have order! Optimizing orders for fair reviewer assignment","authors":"Zick Payan, Justin Payan, Yair Zick","year":"2022","venue":"Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems","doi":null,"url":null,"internal_url":"/proceedings/2022/63"},{"position":42,"raw":"[Plaut and Roughgarden, 2020a] Benjamin Plaut and Tim Roughgarden. Almost envy-freeness with general val- uations. SIAM Journal on Discrete Mathematics, 34(2):1039-1068, 2020.","title":"Almost envy-freeness with general valuations","authors":"Roughgarden Plaut, Benjamin Plaut, Tim Roughgarden","year":"2020","venue":"SIAM Journal on Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Plaut and Roughgarden, 2020b] Benjamin Plaut and Tim Roughgarden. Almost envy-freeness with general val- uations. SIAM Journal on Discrete Mathematics, 34(2):1039-1068, 2020.","title":"Almost envy-freeness with general valuations","authors":"Roughgarden Plaut, Benjamin Plaut, Tim Roughgarden","year":"2020","venue":"SIAM Journal on Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Saban and Sethuraman, 2014] Daniela Saban and Jay Sethuraman. A note on object allocation under lexico- graphic preferences. Journal of Mathematical Economics, 50:283-289, 2014.","title":"A note on object allocation under lexicographic preferences","authors":"Daniela Saban, Jay Sethuraman","year":"2014","venue":"Journal of Mathematical Economics","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Schmidt et al., 2021] Harald Schmidt, Rebecca Weintraub, Michelle A. Williams, Kate Miller, Alison Buttenheim, Emily Sadecki, Helen Wu, Aditi Doiphode, Neha Nagpal, Lawrence O. Gostin, and Angela A. Shen. Equitable allo- cation of COVID-19 vaccines in the United States. Nature Medicine, 27:1298-1307, 2021.","title":"Equitable allocation of COVID-19 vaccines in the United States","authors":"Harald Schmidt, Rebecca Weintraub, Michelle A Williams, Kate Miller, Alison Buttenheim, Emily Sadecki, Helen Wu, Aditi Doiphode, Neha Nagpal, Lawrence O Gostin, Angela A Shen","year":"2021","venue":"Nature Medicine","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Shah, 2022] Nihar B Shah. Challenges, experiments, and computational solutions in peer review. Communications of the ACM, 65(6):76-87, 2022.","title":"Challenges, experiments, and computational solutions in peer review","authors":"B Nihar, Shah","year":"2022","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Viswanathan and Zick, 2023] Vignesh Viswanathan and Yair Zick. Yankee swap: A fast and simple fair allocation mechanism for matroid rank valuations. In Proceedings of the 22nd International Conference on Autonomous Agents and MultiAgent Systems, 2023. forthcoming.","title":"Yankee swap: A fast and simple fair allocation mechanism for matroid rank valuations","authors":"Zick Viswanathan, Vignesh Viswanathan, Yair Zick","year":"2023","venue":"Proceedings of the 22nd International Conference on Autonomous Agents and MultiAgent Systems","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}