{"type":"ScholarlyArticle","title":"On the Complexity of Chore Division","authors":[{"name":"Alireza Farhadi","slug":"alireza-farhadi","given":"Alireza","family":"Farhadi","affiliation":"University of Maryland , College Park"},{"name":"MohammadTaghi Hajiaghayi","slug":"mohammadtaghi-hajiaghayi","given":"MohammadTaghi","family":"Hajiaghayi","affiliation":"University of Maryland , College Park"}],"abstract":"We study the proportional chore division problem where a protocol wants to divide an undesirable object, called chore, among n different players. This problem is the dual variant of the cake cutting problem in which we want to allocate a desirable object. In this paper, we show that chore division and cake cutting problems are closely related to each other and provide a tight lower bound for proportional chore division.","doi":"10.24963/ijcai.2018/31","url":"https://ijcai.org/proceedings/2018/31","pdf":"https://ijcai.org/proceedings/2018/0031.pdf","markdown":"https://ijcai.org/proceedings/2018/31.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/31","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":31,"pages":{"first":226,"last":232},"keywords":["Agent-based and Multi-agent Systems: Noncooperative Games","Agent-based and Multi-agent Systems: Algorithmic Game Theory"],"videos":[],"references":[{"position":1,"raw":"[Aziz and Mackenzie, 2016a] Haris Aziz and Simon Mackenzie. A discrete and bounded envy-free cake cutting protocol for any number of agents. In Foundations of Computer Science (FOCS), 2016 IEEE 57th Annual Symposium on, pages 416-427. IEEE, 2016.","title":"A discrete and bounded envy-free cake cutting protocol for any number of agents","authors":"Aziz, Mackenzie ;, Haris Aziz, Simon Mackenzie","year":"2016","venue":"Foundations of Computer Science (FOCS)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Aziz and Mackenzie, 2016b] Haris Aziz and Simon Mackenzie. A discrete and bounded envy-free cake cutting protocol for four agents. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, pages 454-464. ACM, 2016.","title":"A discrete and bounded envy-free cake cutting protocol for four agents","authors":"Aziz, Mackenzie ;, Haris Aziz, Simon Mackenzie","year":"2016","venue":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Brams and Taylor, 1995] Steven J Brams and Alan D Tay- lor. An envy-free cake division protocol. The American Mathematical Monthly, 102(1):9-18, 1995.","title":"An envy-free cake division protocol","authors":"J Steven, Alan D Brams, Taylor","year":"1995","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Dehghani et al., 2018] Sina Dehghani, Alireza Farhadi, MohammadTaghi HajiAghayi, and Hadi Yami. Envy-free chore division for an arbitrary number of agents. In Pro- ceedings of the Twenty-Ninth Annual ACM-SIAM Sympo- sium on Discrete Algorithms, pages 2564-2583. SIAM, 2018.","title":"Envy-free chore division for an arbitrary number of agents","authors":"Sina Dehghani, Alireza Farhadi, Mohammadtaghi Hajiaghayi, Hadi Yami","year":"2018","venue":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Edmonds and Pruhs, 2006] Jeff Edmonds and Kirk Pruhs. Cake cutting really is not a piece of cake. In Proceed- ings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 271-278. Society for Industrial and Applied Mathematics, 2006.","title":"Cake cutting really is not a piece of cake","authors":"Pruhs Edmonds, Jeff Edmonds, Kirk Pruhs","year":"2006","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Even and Paz, 1984] Shimon Even and Azaria Paz. A note on cake cutting. Discrete Applied Mathematics, 7(3):285- 296, 1984.","title":"Shimon Even and Azaria Paz. A note on cake cutting","authors":"Paz Even","year":"1984","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gardner, 1978] Martin Gardner. Aha! Aha! insight, vol- ume 1. Scientific American, 1978.","title":"Aha! Aha! insight","authors":"Martin Gardner","year":"1978","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Peterson and Su, 2002] Elisha Peterson and Francis Edward Su. Four-person envy-free chore division. Mathematics Magazine, 75(2):117-122, 2002.","title":"Elisha Peterson and Francis Edward Su. Four-person envy-free chore division","authors":"Su Peterson","year":"2002","venue":"Mathematics Magazine","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Peterson and Su, 2009] Elisha Peterson and Francis Edward Su. N-person envy-free chore division. arXiv preprint arXiv:0909.0303, 2009.","title":"Elisha Peterson and Francis Edward Su. N-person envy-free chore division","authors":"Su Peterson","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Pikhurko, 2000] Oleg Pikhurko. On envy-free cake divi- sion. The American Mathematical Monthly, 107(8):736- 738, 2000.","title":"On envy-free cake division","authors":"Oleg Pikhurko","year":"2000","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Procaccia, 2009] Ariel D Procaccia. Thou shalt covet thy neighbor's cake. In IJCAI, volume 9, pages 239-244, 2009.","title":"Thou shalt covet thy neighbor's cake","authors":"D Ariel, Procaccia","year":"2009","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2009/49"},{"position":12,"raw":"[Robertson and Webb, 1998] Jack Robertson and William Webb. Cake-cutting algorithms: Be fair if you can. 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":13,"raw":"[Steinhaus, 1948] Hugo Steinhaus. The problem of fair divi- sion. Econometrica, 16:101-104, 1948.","title":"Hugo Steinhaus. The problem of fair division","authors":"Steinhaus","year":"1948","venue":"Econometrica","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}