{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/algorithms-for-graph-constrained-coalition","title":"Algorithms for Graph-Constrained Coalition Formation in the Real World","arxiv_id":"1612.04299","date":"2016-12-13","proceeding":null,"authors":["Filippo Bistaffa","Alessandro Farinelli","Jesús Cerquides","Juan A. Rodríguez-Aguilar","Sarvapali D. Ramchurn"],"abstract":"Coalition formation typically involves the coming together of multiple,\nheterogeneous, agents to achieve both their individual and collective goals. In\nthis paper, we focus on a special case of coalition formation known as\nGraph-Constrained Coalition Formation (GCCF) whereby a network connecting the\nagents constrains the formation of coalitions. We focus on this type of problem\ngiven that in many real-world applications, agents may be connected by a\ncommunication network or only trust certain peers in their social network. We\npropose a novel representation of this problem based on the concept of edge\ncontraction, which allows us to model the search space induced by the GCCF\nproblem as a rooted tree. Then, we propose an anytime solution algorithm\n(CFSS), which is particularly efficient when applied to a general class of\ncharacteristic functions called $m+a$ functions. Moreover, we show how CFSS can\nbe efficiently parallelised to solve GCCF using a non-redundant partition of\nthe search space. We benchmark CFSS on both synthetic and realistic scenarios,\nusing a real-world dataset consisting of the energy consumption of a large\nnumber of households in the UK. Our results show that, in the best case, the\nserial version of CFSS is 4 orders of magnitude faster than the state of the\nart, while the parallel version is 9.44 times faster than the serial version on\na 12-core machine. Moreover, CFSS is the first approach to provide anytime\napproximate solutions with quality guarantees for very large systems of agents\n(i.e., with more than 2700 agents).","url_abs":"http://arxiv.org/abs/1612.04299v1","url_pdf":"http://arxiv.org/pdf/1612.04299v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"algorithms-for-graph-constrained-coalition","repo_url":"https://github.com/filippobistaffa/CFSS","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}