Voting-Based Group Formation

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. PDF

Cite

Text

Faliszewski et al. "Voting-Based Group Formation." International Joint Conference on Artificial Intelligence, 2016.

Markdown

[Faliszewski et al. "Voting-Based Group Formation." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/faliszewski2016ijcai-voting/)

BibTeX

@inproceedings{faliszewski2016ijcai-voting,
  title     = {{Voting-Based Group Formation}},
  author    = {Faliszewski, Piotr and Slinko, Arkadii M. and Talmon, Nimrod},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {243-249},
  url       = {https://mlanthology.org/ijcai/2016/faliszewski2016ijcai-voting/}
}