{"type":"ScholarlyArticle","title":"Voting-Based Group Formation","authors":[{"name":"Piotr Faliszewski","slug":"piotr-faliszewski","given":"Piotr","family":"Faliszewski","affiliation":""},{"name":"Arkadii M. Slinko","slug":"arkadii-m-slinko","given":"Arkadii M.","family":"Slinko","affiliation":""},{"name":"Nimrod Talmon","slug":"nimrod-talmon","given":"Nimrod","family":"Talmon","affiliation":""}],"abstract":"We study a combinatorial problem formulated in terms of the following group-formation scenario. Given some agents, where each agent has preferences over the set of potential group leaders, the task is to partition the agents into groups and assign a group leader to each of them, so that the group leaders have as high support as possible from the groups they are assigned to lead. We model this scenario as a voting problem, where the goal is to partition a set of voters into a prescribed number of groups so that each group elects its leader, i.e., their leader is a unique winner in the corresponding election. We study the computational complexity of this problem (and several of its variants) for Approval elections.","doi":null,"url":"https://ijcai.org/proceedings/2016/42","pdf":"https://ijcai.org/proceedings/2016/0042.pdf","markdown":"https://ijcai.org/proceedings/2016/42.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/42","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":42,"pages":{"first":243,"last":248},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}