{"type":"ScholarlyArticle","title":"Constrained Coalition Formation on Valuation Structures: Formal Framework, Applications, and Islands of Tractability (Extended Abstract)","authors":[{"name":"Gianluigi Greco","slug":"gianluigi-greco","given":"Gianluigi","family":"Greco","affiliation":"University of Calabria , Italy"},{"name":"Antonella Guzzo","slug":"antonella-guzzo","given":"Antonella","family":"Guzzo","affiliation":"University of Calabria , Italy"}],"abstract":"Coalition structure generation is considered in a setting where feasible coalition structures must satisfy constraints of two different kinds modeled in terms of a valuation structure, which consists of a set of pivotal agents that are pairwise incompatible, plus an interaction graph prescribing that a coalition C can form only if the subgraph induced over the nodes/agents in C is connected. It is shown that valuation structures can be used to model a number of relevant problems in real-world applications. Moreover, complexity issues arising with them are studied, by focusing in particular on identifying islands of tractability based on topological properties of the underlying interaction graph. Stability issues on valuation structures are studied too.","doi":"10.24963/ijcai.2018/795","url":"https://ijcai.org/proceedings/2018/795","pdf":"https://ijcai.org/proceedings/2018/0795.pdf","markdown":"https://ijcai.org/proceedings/2018/795.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/795","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":"Journal track","track":"Journal track","number":795,"pages":{"first":5612,"last":5616},"keywords":["Agent-based and Multi-agent Systems: Cooperative Games","Agent-based and Multi-agent Systems: Coordination and Cooperation","Knowledge Representation and Reasoning: Computational Complexity of Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Bansal et al., 2004] Nikhil Bansal, Avrim Blum, and Shuchi Chawla. Correlation clustering. Machine Learning, 56(1- 3):89-113, 2004.","title":"Correlation clustering","authors":"Nikhil Bansal, Avrim Blum, Shuchi Chawla","year":"2004","venue":"Machine Learning","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bodlaender, 1996] Hans L. Bodlaender. A linear-time algo- rithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25(6):1305-1317, 1996.","title":"A linear-time algorithm for finding tree-decompositions of small treewidth","authors":"L Hans, Bodlaender","year":"1996","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bonchi et al., 2012] Francesco Bonchi, Aristides Gionis, Francesco Gullo, and Antti Ukkonen. Chromatic corre- lation clustering. In Proc. of KDD'12, pages 1321-1329.","title":"Chromatic correlation clustering","authors":"Francesco Bonchi, Aristides Gionis, Francesco Gullo, Antti Ukkonen","year":null,"venue":"Proc. of KDD'12","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Breton et al., 1992] M. Breton, G. Owen, and S. Weber. Strongly balanced cooperative games. International Jour- nal of Game Theory, 20(4):419-427, 1992.","title":"Strongly balanced cooperative games","authors":"M Breton, G Owen, S Weber","year":"1992","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chalkiadakis et al., 2011] Georgios Chalkiadakis, Edith Elkind, and Michael Wooldridge. Computational aspects of cooperative game theory. Synthesis Lectures on Artifi- cial Intelligence and Machine Learning, 5(6):1-168, 2011.","title":"Computational aspects of cooperative game theory","authors":"Georgios Chalkiadakis, Edith Elkind, Michael Wooldridge","year":"2011","venue":"Synthesis Lectures on Artificial Intelligence and Machine Learning","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chalkiadakis et al., 2016] Georgios Chalkiadakis, Gian- luigi Greco, and Evangelos Markakis. Characteristic function games with restricted agent interactions: Core- stability and coalition structures. Artificial Intelligence, 232:76-113, 2016.","title":"Characteristic function games with restricted agent interactions: Corestability and coalition structures","authors":"Georgios Chalkiadakis, Gianluigi Greco, Evangelos Markakis","year":"2016","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Conitzer and Sandholm, 2006] Vincent Conitzer and Tuo- mas Sandholm. Complexity of constructing solutions in the core based on synergies among coalitions. Artificial Intelligence, 170(6-7):607-619, May 2006.","title":"Complexity of constructing solutions in the core based on synergies among coalitions","authors":"Sandholm Conitzer, Vincent Conitzer, Tuomas Sandholm","year":"2006","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Cowans and Szummer, 2005] Philip J Cowans and Martin Szummer. A graphical model for simultaneous partition- ing and labeling. In Proc. of AISTATS'05, pages 73-80.","title":"A graphical model for simultaneous partitioning and labeling","authors":"J Philip, Martin Cowans, Szummer","year":null,"venue":"Proc. of AISTATS'05","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dahlhaus et al., 1994] E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM Journal of Com- puting, 23(4):864-894, 1994.","title":"The complexity of multiterminal cuts","authors":"E Dahlhaus, D S Johnson, C H Papadimitriou, P D Seymour, M Yannakakis","year":"1994","venue":"SIAM Journal of Computing","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Demange, 2004] Gabrielle Demange. On group stability in hierarchies and networks. Journal of Political Economy, 112(4):754-778, August 2004.","title":"On group stability in hierarchies and networks","authors":"Gabrielle Demange, Demange","year":"2004","venue":"Journal of Political Economy","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Demange, 2009] Gabrielle Demange. The strategy structure of some coalition formation games. Games and Economic Behavior, 65(1):83-104, 2009.","title":"The strategy structure of some coalition formation games","authors":"Gabrielle Demange, Demange","year":"2009","venue":"Games and Economic Behavior","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Deng and Papadimitriou, 1994] Xiaotie Deng and Chris- tos H. Papadimitriou. On the complexity of cooperative solution concepts. Mathematics of Operations Research, 19(2):257-266, 1994.","title":"Xiaotie Deng and Christos H. Papadimitriou. On the complexity of cooperative solution concepts","authors":"Papadimitriou Deng","year":"1994","venue":"Mathematics of Operations Research","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Elkind et al., 2009] Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, and Michael Wooldridge. On the com- putational complexity of weighted voting games. Annals of Mathematics and Artificial Intelligence, 56(2):109-131, 2009.","title":"On the computational complexity of weighted voting games","authors":"Edith Elkind, Leslie, Ann Goldberg, Paul W Goldberg, Michael Wooldridge","year":"2009","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Giotis and Guruswami, 2006] Ioannis Giotis and Venkate- san Guruswami. Correlation clustering with a fixed num- ber of clusters. In Proc. of SODA'06, pages 1167-1176.","title":"Ioannis Giotis and Venkatesan Guruswami. Correlation clustering with a fixed number of clusters","authors":"Guruswami Giotis","year":"2006","venue":"Proc. of SODA'06","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Greco and Guzzo, 2017] Gianluigi Greco and Antonella Guzzo. Constrained coalition formation on valuation structures: Formal framework, applications, and islands of tractability. Artificial Intelligence, 249:19-46, 2017.","title":"Constrained coalition formation on valuation structures: Formal framework, applications, and islands of tractability","authors":"Guzzo Greco, Gianluigi Greco, Antonella Guzzo","year":"2017","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Greco et al., 2011] Gianluigi Greco, Enrico Malizia, Luigi Palopoli, and Francesco Scarcello. On the complexity of core, kernel, and bargaining set. Artificial Intelligence, 175(12-13):1877-1910, 2011.","title":"On the complexity of core, kernel, and bargaining set","authors":"Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello","year":"2011","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Ieong and Shoham, 2005] Samuel Ieong and Yoav Shoham. Marginal contribution nets: a compact representation scheme for coalitional games. In Proc. of EC'05, pages 193-202, 2005.","title":"Samuel Ieong and Yoav Shoham. Marginal contribution nets: a compact representation scheme for coalitional games","authors":"Shoham Ieong","year":"2005","venue":"Proc. of EC'05","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kalai and Zemel, 1980] Ehud Kalai and Eitan Zemel. On totally balanced games and games of flow. Discussion Paper 413, Northwestern University, Center for Mathe- matical Studies in Economics and Management Science, Evanston, IL, USA, 1980.","title":"On totally balanced games and games of flow","authors":"Zemel Kalai, Ehud Kalai, Eitan Zemel","year":"1980","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Megiddo, 1978] Nimrod Megiddo. Computational com- plexity of the game theory approach to cost allocation for a tree. Mathematics of Operations Research, 3(3):189-196, 1978.","title":"Nimrod Megiddo. Computational complexity of the game theory approach to cost allocation for a tree","authors":"Megiddo","year":"1978","venue":"Mathematics of Operations Research","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Myerson, 1977] Roger B. Myerson. Graphs and cooper- ation in games. Mathematics of Operations Research, 2(3):225-229, 1977.","title":"Graphs and cooperation in games","authors":"B Roger, Myerson","year":"1977","venue":"Mathematics of Operations Research","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Osborne and Rubinstein, 1994] Martin J. Osborne and Ariel Rubinstein. A Course in Game Theory. The MIT Press, Cambridge, MA, USA, July 1994.","title":"A Course in Game Theory","authors":"Martin J Osborne, Ariel Rubinstein","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Rahwan and Jennings, 2007] Talal Rahwan and Nicholas R. Jennings. An algorithm for distributing coalitional value calculations among cooperating agents. Artificial Intelli- gence, 171(8-9):535-567, 2007.","title":"An algorithm for distributing coalitional value calculations among cooperating agents","authors":"Talal Rahwan, Nicholas R Jennings","year":"2007","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Rahwan et al., 2011] Talal Rahwan, Tomasz P Michalak, Edith Elkind, Piotr Faliszewski, Jacek Sroka, Michael Wooldridge, and Nicholas R Jennings. Constrained coali- tion formation. In Proc. of AAAI'11, pages 719-725, 2011.","title":"Constrained coalition formation","authors":"Talal Rahwan, P Tomasz, Edith Michalak, Piotr Elkind, Jacek Faliszewski, Michael Sroka, Nicholas R Wooldridge, Jennings","year":"2011","venue":"Proc. of AAAI'11","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Rahwan et al., 2015] Talal Rahwan, Tomasz P. Michalak, Michael Wooldridge, and Nicholas R. Jennings. Coali- tion structure generation: A survey. Artificial Intelligence, 229:139-174, 2015.","title":"Coalition structure generation: A survey","authors":"Talal Rahwan, P Tomasz, Michael Michalak, Nicholas R Wooldridge, Jennings","year":"2015","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Robertson and Seymour, 1984] N. Robertson and P.D. Sey- mour. Graph minors iii: Planar tree-width. Journal of Combinatorial Theory, Series B, 36(1):49-64, February 1984.","title":"Graph minors iii: Planar tree-width","authors":"N Robertson, P D Seymour","year":"1984","venue":"Journal of Combinatorial Theory, Series B","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Shehory and Kraus, 1998] Onn Shehory and Sarit Kraus. Methods for task allocation via agent coalition formation. Artificial Intelligence, 101(1-2):165-200, 1998.","title":"Onn Shehory and Sarit Kraus. Methods for task allocation via agent coalition formation","authors":"Kraus Shehory","year":"1998","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Voice et al., 2012] Thomas Voice, Maria Polukarov, and Nicholas R. Jennings. Coalition structure generation over graphs. Journal of Artificial Intelligence Research, 45(1):165-196, 2012.","title":"Coalition structure generation over graphs","authors":"Thomas Voice, Maria Polukarov, Nicholas R Jennings","year":"2012","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}