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.
|Number of pages||7|
|Journal||IJCAI International Joint Conference on Artificial Intelligence|
|State||Published - 1 Jan 2016|
|Event||25th International Joint Conference on Artificial Intelligence, IJCAI 2016 - New York, United States|
Duration: 9 Jul 2016 → 15 Jul 2016