Voting-Based Group Formation
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 243-248.
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.
@inproceedings{ijcai2016p42,
title = {Voting-Based Group Formation},
author = {Faliszewski, Piotr and Slinko, Arkadii M. and Talmon, Nimrod},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {243--248},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/42},
}
TY - CPAPER TI - Voting-Based Group Formation AU - Faliszewski, Piotr AU - Slinko, Arkadii M. AU - Talmon, Nimrod T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 243 EP - 248 UR - https://ijcai.org/proceedings/2016/42 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
