Robustness among multiwinner voting rules

DOI10.1007/978-3-319-66700-3_7zbMath1403.91129arXiv1707.01417OpenAlexW2963352083WikidataQ62039057 ScholiaQ62039057MaRDI QIDQ5894693

Nimrod Talmon, Piotr Skowron, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Robert Bredereck

Publication date: 13 February 2018

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.01417

zbMATH Keywords

\({\mathrm {FPT}}\) algorithms\({\mathrm {NP}}\)-hardmultiwinner voting rules

Mathematics Subject Classification ID

Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

Isomorphic Distances Among Elections ⋮ Resolute control: forbidding candidates from winning an election is hard ⋮ Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules ⋮ Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas ⋮ Approximation and hardness of shift-Bribery ⋮ Robustness among multiwinner voting rules ⋮ Robustness of approval-based multiwinner voting rules ⋮ Utilitarian welfare and representation guarantees of approval-based multiwinner rules

This page was built for publication: Robustness among multiwinner voting rules