{"type":"ScholarlyArticle","title":"Maximin Share Allocations on Cycles","authors":[{"name":"Zbigniew Lonc","slug":"zbigniew-lonc","given":"Zbigniew","family":"Lonc","affiliation":"Warsaw University of Technology , Poland"},{"name":"Miroslaw Truszczynski","slug":"miroslaw-truszczynski","given":"Miroslaw","family":"Truszczynski","affiliation":"University of Kentucky , USA"}],"abstract":"The problem of fair division of indivisible goods is a fundamental problem of social choice. Recently, the problem was extended to the setting when goods form a graph and the goal is to allocate goods to agents so that each agent's bundle forms a connected subgraph. Researchers proved that, unlike in the original problem (which corresponds to the case of the complete graph in the extended setting), in the case of the goods-graph being a tree, allocations offering each agent a bundle of or exceeding her maximin share value always exist. Moreover, they can be found in polynomial time. We consider here the problem of maximin share allocations of goods on a cycle. Despite the simplicity of the graph, the problem turns out be significantly harder than its tree version. We present cases when maximin share allocations of goods on cycles exist and provide results on allocations guaranteeing each agent a certain portion of her maximin share. We also study algorithms for computing maximin share allocations of goods on cycles.","doi":"10.24963/ijcai.2018/57","url":"https://ijcai.org/proceedings/2018/57","pdf":"https://ijcai.org/proceedings/2018/0057.pdf","markdown":"https://ijcai.org/proceedings/2018/57.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/57","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":57,"pages":{"first":410,"last":416},"keywords":["Knowledge Representation and Reasoning: Preference Modelling and Preference-Based Reasoning","Agent-based and Multi-agent Systems: Computational Social Choice","Agent-based and Multi-agent Systems: Resource Allocation"],"videos":[],"references":[{"position":1,"raw":"[Amanatidis et al., 2015] Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, and Amin Saberi. Approxi- mation algorithms for computing maximin share alloca- tions. In Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, and Bettina Speckmann, editors, Proceedings of the 42nd International Colloquium on Automata, Lan- guages, and Programming, LNCS 9134, pages 39-51. Springer, 2015.","title":"Approximation algorithms for computing maximin share allocations","authors":"Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi","year":"2015","venue":"Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming","doi":null,"url":null,"internal_url":null},{"position":2,"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":3,"raw":"[Bouveret et al., 2016] Sylvain Bouveret, Yann Chevaleyre, and Nicolas Maudet. Fair allocation of indivisible goods. In Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia, editors, Handbook of Com- putational Social Choice, pages 284-310. Cambridge Uni- versity Press, 2016.","title":"Fair allocation of indivisible goods","authors":"Sylvain Bouveret, Yann Chevaleyre, Nicolas Maudet","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bouveret et al., 2017] Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, and Do- minik Peters. Fair division of a graph. In Carles Sierra, editor, Proceedings of the 26th International Joint Con- ference on Artificial Intelligence, IJCAI 2017, pages 135-141. ijcai.org, 2017.","title":"Fair division of a graph","authors":"Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, Dominik Peters","year":"2017","venue":"Proceedings of the 26th International Joint Conference on Artificial Intelligence, IJCAI 2017","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Brams and Taylor, 1996] Steven J. Brams and Alan D. Tay- lor. Fair Division: From Cake-Cutting to Dispute Resolu- tion. 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":6,"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":7,"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 and Co., 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":8,"raw":"[King and Burton, 1982] Russell King and Steve Burton. Land fragmentation: Notes on a fundamental rural spa- tial problem. Progress in Human Geography, 6(4):475- 94, 1982.","title":"Russell King and Steve Burton. Land fragmentation: Notes on a fundamental rural spatial problem","authors":"Burton King","year":"1982","venue":"Progress in Human Geography","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Procaccia and Wang, 2014] Ariel D. Procaccia and Junxing Wang. Fair enough: guaranteeing approximate maximin shares. In Moshe Babaioff, Vincent Conitzer, and David Easley, editors, Proceedings of the ACM Conference on Economics and Computation, EC-2014, pages 675-692. ACM, 2014.","title":"Fair enough: guaranteeing approximate maximin shares","authors":"Ariel D Procaccia, Junxing Wang","year":"2014","venue":"Proceedings of the ACM Conference on Economics and Computation, EC-2014","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Procaccia, 2016] Ariel Procaccia. Cake-cutting algorithms. In Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia, editors, Handbook of Com- putational Social Choice, pages 311-329. Cambridge Uni- versity Press, 2016.","title":"Cake-cutting algorithms","authors":"Ariel Procaccia","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}