{"type":"ScholarlyArticle","title":"Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents","authors":[{"name":"Tianze Wei","slug":"tianze-wei","given":"Tianze","family":"Wei","affiliation":"Department of Computer Science , City University of Hong Kong"},{"name":"Bo Li","slug":"bo-li","given":"Bo","family":"Li","affiliation":"Department of Computing , The Hong Kong Polytechnic University"},{"name":"Minming Li","slug":"minming-li","given":"Minming","family":"Li","affiliation":"Department of Computer Science , City University of Hong Kong; School of Mathematical Sciences , Ocean University of China"}],"abstract":"The real-world deployment of fair allocation algorithms usually involves a heterogeneous population of users, which makes it challenging for the users to get complete knowledge of the allocation except for their own bundles. Recently, a new fairness notion, maximin-awareness (MMA) was proposed and it guarantees that every agent is not the worst-off one, no matter how the items that are not allocated to this agent are distributed. We adapt and generalize this notion to the case of indivisible chores and when the agents may have arbitrary weights. Due to the inherent difficulty of MMA, we also consider its up to one and up to any relaxations. A string of results on the existence and computation of MMA related fair allocations, and their connections to existing fairness concepts is given.","doi":"10.24963/ijcai.2023/323","url":"https://ijcai.org/proceedings/2023/323","pdf":"https://ijcai.org/proceedings/2023/0323.pdf","markdown":"https://ijcai.org/proceedings/2023/323.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/323","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":323,"pages":{"first":2897,"last":2905},"keywords":["Game Theory and Economic Paradigms: GTEP: Computational social choice","Game Theory and Economic Paradigms: GTEP: Fair division"],"videos":[],"references":[{"position":1,"raw":"[Amanatidis et al., 2022] Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Hervé Moulin, Alexandros A. Voudouris, and Xiaowei Wu. Fair division of indivisible goods: A survey. CoRR, abs/2208.08782, 2022.","title":"Fair division of indivisible goods: A survey","authors":"Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Hervé Moulin, Alexandros A Voudouris, Xiaowei Wu","year":"2022","venue":null,"doi":null,"url":null,"internal_url":"/proceedings/2022/756"},{"position":2,"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 AAAI Conference on Artificial Intelligence, pages 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 AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Aziz et al., 2018] Haris Aziz, Sylvain Bouveret, Ioannis Caragiannis, Ira Giagkousi, and Jérôme Lang. Knowl- edge, fairness, and social constraints. In Proceedings of the AAAI Conference on Artificial Intelligence, pages 4638- 4645, 2018.","title":"Knowledge, fairness, and social constraints","authors":"Haris Aziz, Sylvain Bouveret, Ioannis Caragiannis, Ira Giagkousi, Jérôme Lang","year":"2018","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Aziz et al., 2019] Haris Aziz, Hau Chan, and Bo Li. Weighted maxmin fair share allocation of indivisible chores. In Proceedings of the 28th International Joint Conference on Artificial Intelligence, pages 46-52, 2019.","title":"Weighted maxmin fair share allocation of indivisible chores","authors":"Haris Aziz, Hau Chan, Bo Li","year":"2019","venue":"Proceedings of the 28th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2019/7"},{"position":5,"raw":"[Aziz et al., 2020] Haris Aziz, Hervé Moulin, and Fedor Sandomirskiy. A polynomial-time algorithm for comput- ing a pareto optimal and almost proportional allocation. Operations Research Letters, 48(5):573-578, 2020.","title":"A polynomial-time algorithm for computing a pareto optimal and almost proportional allocation","authors":"Haris Aziz, Hervé Moulin, Fedor Sandomirskiy","year":"2020","venue":"Operations Research Letters","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Barman and Krishnamurthy, 2020] Siddharth Barman and Sanath Kumar Krishnamurthy. Approximation algorithms for maximin fair division. ACM Transactions on Eco- nomics and Computation, 8(1):1-28, 2020.","title":"Approximation algorithms for maximin fair division","authors":"Siddharth Barman, Sanath Kumar, Krishnamurthy","year":"2020","venue":"ACM Transactions on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bhaskar et al., 2021] Umang Bhaskar, A. R. Sricharan, and Rohit Vaish. On approximate envy-freeness for indivisible chores and mixed resources. In Approximation, Random- ization, and Combinatorial Optimization. Algorithms and Techniques, pages 1-23, 2021.","title":"On approximate envy-freeness for indivisible chores and mixed resources","authors":"Umang Bhaskar, A R Sricharan, Rohit Vaish","year":"2021","venue":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bouveret and Lemaître, 2016] Sylvain Bouveret and Michel Lemaître. Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Autonomous Agents and Multi-Agent Systems, 30(2):259-290, 2016.","title":"Characterizing conflicts in fair division of indivisible goods using a scale of criteria","authors":"Lemaître Bouveret, Sylvain Bouveret, Michel Lemaître","year":"2016","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":9,"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":10,"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):1-32, 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":11,"raw":"[Caragiannis et al., 2022] Ioannis Caragiannis, Jugal Garg, Nidhi Rathi, Eklavya Sharma, and Giovanna Varricchio. Existence and computation of epistemic EFX. CoRR, abs/2206.01710, 2022.","title":"Existence and computation of epistemic EFX","authors":"Ioannis Caragiannis, Jugal Garg, Nidhi Rathi, Eklavya Sharma, Giovanna Varricchio","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Chan et al., 2019] Hau Chan, Jing Chen, Bo Li, and Xi- aowei Wu. Maximin-aware allocations of indivisible goods. In Proceedings of the 28th International Joint Con- ference on Artificial Intelligence, pages 137-143, 2019.","title":"Maximin-aware allocations of indivisible goods","authors":"Jing Hau Chan, Bo Chen, Xiaowei Li, Wu","year":"2019","venue":"Proceedings of the 28th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2019/20"},{"position":13,"raw":"[Chen and Shah, 2017] Yiling Chen and Nisarg Shah. Ig- norance is often bliss: Envy with incomplete informa- tion. Technical report, Working paper, Harvard University, 2017.","title":"Ignorance is often bliss: Envy with incomplete information","authors":"Chen, Shah, Yiling Chen, Nisarg Shah","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Conitzer et al., 2017] Vincent Conitzer, Rupert Freeman, and Nisarg Shah. Fair public decision making. In Pro- ceedings of the 18th ACM Conference on Economics and Computation, pages 629-646, 2017.","title":"Fair public decision making","authors":"Vincent Conitzer, Rupert Freeman, Nisarg Shah","year":"2017","venue":"Proceedings of the 18th ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Feige and Huang, 2022] Uriel Feige and Xin Huang. On picking sequences for chores. CoRR, abs/2211.13951, 2022.","title":"On picking sequences for chores","authors":"Huang Feige, Uriel Feige, Xin Huang","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Garg et al., 2022] Jugal Garg, Aniket Murhekar, and John Qin. Fair and efficient allocations of chores under bivalued preferences. In Proceedings of the AAAI Conference on Artificial Intelligence, pages 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":17,"raw":"[Grandl et al., 2014] Robert Grandl, Ganesh Anantha- narayanan, Srikanth Kandula, Sriram Rao, and Aditya Akella. Multi-resource packing for cluster schedulers. ACM SIGCOMM Computer Communication Review, 44(4):455-466, 2014.","title":"Multi-resource packing for cluster schedulers","authors":"Robert Grandl, Ganesh Ananthanarayanan, Srikanth Kandula, Sriram Rao, Aditya Akella","year":"2014","venue":"ACM SIGCOMM Computer Communication Review","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Hajiaghayi et al., 2023] MohammadTaghi Hajiaghayi, Max Springer, and Hadi Yami. Almost envy-free allocations of indivisible goods or chores with entitlements. CoRR, abs/2305.16081, 2023.","title":"Almost envy-free allocations of indivisible goods or chores with entitlements","authors":"Hajiaghayi","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Hosseini et al., 2020] Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Hejun Wang, and Lirong Xia. Fair division through information withholding. In Proceedings of the AAAI Con- ference on Artificial Intelligence, pages 2014-2021, 2020.","title":"Fair division through information withholding","authors":"Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Hejun Wang, Lirong Xia","year":"2020","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Huang and Lu, 2021] Xin Huang and Pinyan Lu. An algo- rithmic framework for approximating maximin share allo- cation of chores. In Proceedings of the 22nd ACM Con- ference on Economics and Computation, pages 630-631, 2021.","title":"An algorithmic framework for approximating maximin share allocation of chores","authors":"Lu ; ] Xin Huang, Pinyan Huang, Lu","year":"2021","venue":"Proceedings of the 22nd ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Huang and Segal-Halevi, 2023] Xin Huang and Erel Segal- Halevi. A reduction from chores allocation to job schedul- ing. CoRR, abs/2302.04581, 2023.","title":"A reduction from chores allocation to job scheduling","authors":"Segal-Halevi ; Huang, Xin Huang, Erel Segal-Halevi","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Li et al., 2022] Bo Li, Yingkai Li, and Xiaowei Wu. Almost (weighted) proportional allocations for indivisible chores. In Proceedings of the ACM Web Conference 2022, pages 122-131, 2022.","title":"Almost (weighted) proportional allocations for indivisible chores","authors":"Bo Li, Yingkai Li, Xiaowei Wu","year":"2022","venue":"Proceedings of the ACM Web Conference 2022","doi":null,"url":null,"internal_url":null},{"position":23,"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":24,"raw":"[Moulin, 2003] Hervé Moulin. Fair division and collective welfare. MIT Press, 2003.","title":"Fair division and collective welfare","authors":"Hervé Moulin","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Moulin, 2019] Hervé Moulin. Fair division in the internet age. Annual Review of Economics, 11:407-441, 2019.","title":"Fair division in the internet age","authors":"Hervé Moulin, Moulin","year":"2019","venue":"Annual Review of Economics","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Robertson and Webb, 1998] Jack Robertson and William Webb. Cake-cutting algorithms: Be fair if you can. CRC Press, 1998.","title":"Cake-cutting algorithms: Be fair if you can","authors":"Webb ; Robertson, Jack Robertson, William Webb","year":"1998","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Steinhaus, 1949] Hugo Steinhaus. Sur la division pragma- tique. Econometrica: Journal of the Econometric Society, 17:315-319, 1949.","title":"Hugo Steinhaus. Sur la division pragmatique","authors":"Steinhaus","year":"1949","venue":"Econometrica: Journal of the Econometric Society","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Steven J. Brams and Alan D. Taylor, 1996] Steven J. Brams and Alan D. Taylor. Fair division: from cake-cutting to dispute resolution. Cambridge University Press, 1996.","title":"Fair division: from cake-cutting to dispute resolution","authors":"Steven J Brams, Alan D Taylor","year":"1996","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Sun et al., 2021] Ankang Sun, Bo Chen, and Xuan Vinh Doan. Connections between fairness criteria and effi- ciency for allocating indivisible chores. In Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, pages 1281-1289, 2021.","title":"Connections between fairness criteria and efficiency for allocating indivisible chores","authors":"Sun","year":"2021","venue":"Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Varian, 1974] Hal Varian. Equity, envy, and efficiency. Journal of Economic Theory, 9(1):63-91, 1974.","title":"Hal Varian. Equity, envy, and efficiency","authors":"Varian","year":"1974","venue":"Journal of Economic Theory","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Verma et al., 2015] Abhishek Verma, Luis Pedrosa, Mad- hukar Korupolu, David Oppenheimer, Eric Tune, and John Wilkes. Large-scale cluster management at google with borg. In Proceedings of 10th European Conference on Computer Systems, pages 1-17, 2015.","title":"Large-scale cluster management at google with borg","authors":"Abhishek Verma, Luis Pedrosa, Madhukar Korupolu, David Oppenheimer, Eric Tune, John Wilkes","year":"2015","venue":"Proceedings of 10th European Conference on Computer Systems","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Wu et al., 2023] Xiaowei Wu, Cong Zhang, and Shengwei Zhou. Weighted EF1 allocations for indivisible chores. CoRR, abs/2301.08090, 2023.","title":"Weighted EF1 allocations for indivisible chores","authors":"Xiaowei Wu, Cong Zhang, Shengwei Zhou","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Zhou and Wu, 2022] Shengwei Zhou and Xiaowei Wu. Ap- proximately EFX allocations for indivisible chores. In Proceedings of the 31th International Joint Conference on Artificial Intelligence, pages 783-789, 2022.","title":"Approximately EFX allocations for indivisible chores","authors":"Wu ; ] Shengwei Zhou, Xiaowei Zhou, Wu","year":"2022","venue":"Proceedings of the 31th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2022/110"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}