IJCAI 2020poster0 citations
The Complexity of Election Problems with Group-Separable Preferences
Piotr Faliszewski, Alexander Karpov, Svetlana Obraztsova
Abstract
We analyze the complexity of several NP-hard election-related problems under the assumptions that the voters have group-separable preferences. We show that under this assumption our problems typically remain NP-hard, but we provide more efficient algorithms if additionally the clone decomposition tree is of moderate height.
Agent-based and Multi-agent Systems: VotingAgent-based and Multi-agent Systems: Computational Social ChoiceAgent-based and Multi-agent Systems: Algorithmic Game Theory
BibTeX
@inproceedings{ijcai2020p29,
title = {The Complexity of Election Problems with Group-Separable Preferences},
author = {Faliszewski, Piotr and Karpov, Alexander and Obraztsova, Svetlana},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-20}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Christian Bessiere},
pages = {203--209},
year = {2020},
month = {7},
note = {Main track},
doi = {10.24963/ijcai.2020/29},
url = {https://doi.org/10.24963/ijcai.2020/29},
}