Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting

IJCAI 2019 pp. 637-643

doi:10.24963/IJCAI.2019/90 /ijcai/2019/yang2019ijcai-complexity/

Abstract

We study the complexity of several manipulation and control problems for six prevalent approval based multiwinner voting rules. We show that these rules generally resist the proposed strategic types. In addition, we also give fixed-parameter tractability results for these problems with respect to several natural parameters and derive polynomial-time algorithms for certain special cases.

PDF IJCAI Semantic Scholar

Cite

Text

Yang. "Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/90

Markdown

[Yang. "Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/yang2019ijcai-complexity/) doi:10.24963/IJCAI.2019/90

BibTeX

@inproceedings{yang2019ijcai-complexity,
  title     = {{Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting}},
  author    = {Yang, Yongjie},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {637-643},
  doi       = {10.24963/IJCAI.2019/90},
  url       = {https://mlanthology.org/ijcai/2019/yang2019ijcai-complexity/}
}