Complexity of Manipulative Actions When Voting with Ties

DOI10.1007/978-3-319-23114-3_7zbMath1405.91153arXiv1506.04722OpenAlexW2231369949MaRDI QIDQ3449525

Edith Hemaspaandra, Zack Fitzsimmons

Publication date: 4 November 2015

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

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

zbMATH Keywords

voter's preferenceselection problemcomplexity of manipulation and briberycomplexity of manipulative actions

Mathematics Subject Classification ID

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

Related Items (1)

A parameterized perspective on protecting elections

This page was built for publication: Complexity of Manipulative Actions When Voting with Ties