{"type":"ScholarlyArticle","title":"Weighted Maxmin Fair Share Allocation of Indivisible Chores","authors":[{"name":"Haris Aziz","slug":"haris-aziz","given":"Haris","family":"Aziz","affiliation":"UNSW Sydney and Data61 CSIRO , Australia"},{"name":"Hau Chan","slug":"hau-chan","given":"Hau","family":"Chan","affiliation":"Department of Computer Science and Engineering , University of Nebraska-Lincoln , USA"},{"name":"Bo Li","slug":"bo-li","given":"Bo","family":"Li","affiliation":"Department of Computer Science , Stony Brook University , USA"}],"abstract":"We initiate the study of indivisible chore allocation for agents with asymmetric shares. The fairness concept we focus on is the weighted natural generalization of maxmin share: WMMS fairness and OWMMS fairness. We first highlight the fact that commonly-used algorithms that work well for allocation of goods to asymmetric agents, and even for chores to symmetric agents do not provide good approximations for allocation of chores to asymmetric agents under WMMS. As a consequence, we present a novel polynomial-time constant-approximation algorithm, via linear program, for OWMMS. For two special cases: the binary valuation case and the 2-agent case, we provide exact or better constant-approximation algorithms.","doi":"10.24963/ijcai.2019/7","url":"https://ijcai.org/proceedings/2019/7","pdf":"https://ijcai.org/proceedings/2019/0007.pdf","markdown":"https://ijcai.org/proceedings/2019/7.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/7","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":7,"pages":{"first":46,"last":52},"keywords":["Agent-based and Multi-agent Systems: Resource Allocation","Agent-based and Multi-agent Systems: Computational Social Choice"],"videos":[],"references":[{"position":1,"raw":"[Alon, 1987] N. Alon. Splitting necklaces. Advances in Mathematics, 63(3):247-253, 1987.","title":"Splitting necklaces","authors":"N Alon","year":"1987","venue":"Advances in Mathematics","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Amanatidis et al., 2015] G. Amanatidis, E. Markakis, A. Nikzad, and A. Saberi. Approximation algorithms for computing maximin share allocations. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming, pages 39-51, 2015.","title":"Approximation algorithms for computing maximin share allocations","authors":"G Amanatidis, E Markakis, A Nikzad, A Saberi","year":"2015","venue":"Proceedings of the 35th International Colloquium on Automata, Languages and Programming","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Aziz and Mackenzie, 2016] H. Aziz and S. Mackenzie. A discrete and bounded envy-free cake cutting protocol for any number of agents. In Proceedings of the 57th IEEE Symposium on Foundations of Computer Science, pages 416-427, 2016.","title":"A discrete and bounded envy-free cake cutting protocol for any number of agents","authors":"H Aziz, S Mackenzie","year":"2016","venue":"Proceedings of the 57th IEEE Symposium on Foundations of Computer Science","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Aziz et al., 2017] H. Aziz, G. Rauchecker, G. Schryen, and T. Walsh. Algorithms for max-min share fair allocation of indivisible chores. In Proceedings of 31st AAAI Confer- ence on Artificial Intelligence, pages 335-341, 2017.","title":"Algorithms for max-min share fair allocation of indivisible chores","authors":"H Aziz, G Rauchecker, G Schryen, T Walsh","year":"2017","venue":"Proceedings of 31st AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Aziz et al., 2018] H. Aziz, I. Caragiannis, and A. Igarashi. Fair allocation of combinations of indivisible goods and chores. CoRR, abs/1807.10684, 2018.","title":"Fair allocation of combinations of indivisible goods and chores","authors":"H Aziz, I Caragiannis, A Igarashi","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Aziz, 2016] H. Aziz. Computational social choice: Some current and new directions. In Proceedings of the 25th International Joint Conference on Artificial Intelligence, pages 4054-4057, 2016.","title":"Computational social choice: Some current and new directions","authors":"H Aziz","year":"2016","venue":"Proceedings of the 25th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Babaioff et al., 2017] M. Babaioff, N. Nisan, and I. Talgam- Cohen. Competitive equilibria with indivisible goods and generic budgets. CoRR, abs/1703.08150, 2017.","title":"Competitive equilibria with indivisible goods and generic budgets","authors":"M Babaioff, N Nisan, I Talgam-Cohen","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Barman and Murthy, 2017] S. Barman and S. Kumar Kr- ishna Murthy. Approximation algorithms for maximin fair division. In Proceedings of the 18th ACM conference on Economics and Computation, pages 647-664, 2017.","title":"Approximation algorithms for maximin fair division","authors":"S Barman, S Kumar, Krishna Murthy","year":"2017","venue":"Proceedings of the 18th ACM conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Brams and Taylor, 1995] S. Brams and A. Taylor. An envy- free cake division protocol. The American Mathematical Monthly, 102(1):9-18, 1995.","title":"An envyfree cake division protocol","authors":"S Brams, A Taylor","year":"1995","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Brams and Taylor, 1996] S. Brams and A. Taylor. Fair Divi- sion: From cake-cutting to dispute resolution. Cambridge University Press, 1996.","title":"Fair Division: From cake-cutting to dispute resolution","authors":"S Brams, A Taylor","year":"1996","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Budish, 2011] E. 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":"E Budish","year":"2011","venue":"Journal of Political Economy","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Cseh and Fleiner, 2018] A. Cseh and T. Fleiner. The com- plexity of cake cutting with unequal shares. In Proceed- ings of the 11th International Symposium on Algorithmic Game Theory , pages19-30, 2018.","title":"The complexity of cake cutting with unequal shares","authors":"A Cseh, T Fleiner","year":"2018","venue":"Proceedings of the 11th International Symposium on Algorithmic Game Theory","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Dubins and Spanier, 1961] L. Dubins and E. Spanier. How to cut a cake fairly. The American Mathematical Monthly, 68(1):1-17, 1961.","title":"How to cut a cake fairly","authors":"L Dubins, E Spanier","year":"1961","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Farhadi et al., 2017] A. Farhadi, M. Hajiaghayi, M. Ghodsi, S. Lahaie, D. M. Pennock, M. Seddighin, S. Seddighin, and H. Yami. Fair allocation of indivisible goods to asym- metric agents. In Proceedings of the16th International Conference on Autonomous Agents and Multiagent Sys- tems, pages 1535-1537, 2017.","title":"Fair allocation of indivisible goods to asymmetric agents","authors":"A Farhadi, M Hajiaghayi, M Ghodsi, S Lahaie, D M Pennock, M Seddighin, S Seddighin, H Yami","year":"2017","venue":"Proceedings of the16th International Conference on Autonomous Agents and Multiagent Systems","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Farhadi et al., 2019] A. Farhadi, M. Hajiaghayi, M. Ghodsi, S. Lahaie, D. M. Pennock, M. Seddighin, S. Seddighin, and H. Yami. Fair allocation of indivisible goods to asym- metric agents. Journal of Artifical Intelligence Research (JAIR), 2019.","title":"Fair allocation of indivisible goods to asymmetric agents","authors":"A Farhadi, M Hajiaghayi, M Ghodsi, S Lahaie, D M Pennock, M Seddighin, S Seddighin, H Yami","year":"2019","venue":"Journal of Artifical Intelligence Research (JAIR","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Friesen, 1987] D. Friesen. Tighter bounds for lpt schedul- ing on uniform processors. SIAM Journal on Computing, 16(3):554-560, 1987.","title":"Tighter bounds for lpt scheduling on uniform processors","authors":"D Friesen","year":"1987","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Garey and Johnson, 1979] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.","title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","authors":"M R Garey, D S Johnson","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Ghodsi et al., 2018] M. Ghodsi, M. HajiAghayi, M. Sed- dighin, S. Seddighin, and H. Yami. Fair allocation of indi- visible goods: Improvements and generalizations. In Pro- ceedings of the19th ACM conference on Economics and Computation. ACM Press, 2018.","title":"Fair allocation of indivisible goods: Improvements and generalizations","authors":"M Ghodsi, M Hajiaghayi, M Seddighin, S Seddighin, H Yami","year":"2018","venue":"Proceedings of the19th ACM conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Gonzalez et al., 1977] T. Gonzalez, O. Ibarra, and S. Sahni. Bounds for lpt schedules on uniform processors. SIAM Journal on Computing, 6(1):155-166, 1977.","title":"Bounds for lpt schedules on uniform processors","authors":"T Gonzalez, O Ibarra, S Sahni","year":"1977","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Hochbaum and Shmoys, 1988] D. Hochbaum and D. Shmoys A polynomial approximation scheme for scheduling on uniform processors: Using the dual ap- proximation approach. SIAM journal on computing, 17(3):539-551, 1988.","title":"Shmoys A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach","authors":"D Hochbaum, D","year":"1988","venue":"SIAM journal on computing","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Kurokawa et al., 2018] D. Kurokawa, A. Procaccia, and J. Wang. Fair enough: Guaranteeing approximate max- imin shares. Journal of the ACM (JACM), 65(2):8, 2018.","title":"Fair enough: Guaranteeing approximate maximin shares","authors":"D Kurokawa, A Procaccia, J Wang","year":"2018","venue":"Journal of the ACM (JACM)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lenstra et al., 1990] J. Lenstra, D. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated paral- lel machines. Mathematical programming, 46(1-3):259- 271, 1990.","title":"Approximation algorithms for scheduling unrelated parallel machines","authors":"J Lenstra, D Shmoys, E Tardos","year":"1990","venue":"Mathematical programming","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Pinedo, 2016] M. Pinedo. Scheduling: theory, algorithms, and systems. Springer, 2016.","title":"Scheduling: theory, algorithms, and systems","authors":"M Pinedo","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Procaccia and Wang, 2014] A. D. Procaccia and J. Wang. Fair enough: Guaranteeing approximate maximin shares. In Proceedings of the15th ACM conference on Economics and Computation, pages 675-692. ACM Press, 2014.","title":"Fair enough: Guaranteeing approximate maximin shares","authors":"A D Procaccia, J Wang","year":"2014","venue":"Proceedings of the15th ACM conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Robertson and Webb, 1998] J. Robertson and W. Webb. Cake-cutting algorithms: Be fair if you can. 1998.","title":"Cake-cutting algorithms: Be fair if you can","authors":"J Robertson, W Webb","year":"1998","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Stromquist, 1980] W. Stromquist. How to cut a cake fairly. The American Mathematical Monthly, 87(8):640- 644, 1980.","title":"How to cut a cake fairly","authors":"W Stromquist","year":"1980","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}