Parameterized complexity of control problems in Maximin election

Authors:
Hong Liu;Daming Zhu
Affiliations:
Algorithms Group, School of Computer Science and Technology, Software Park Campus, Shandong University, Jinan, Shandong Province, China;Algorithms Group, School of Computer Science and Technology, Software Park Campus, Shandong University, Jinan, Shandong Province, China
Venue:
Information Processing Letters
Year:
2010

Citing 15
Cited 5

Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
Perfect code is W[1]-complete

Information Processing Letters
Social Choice Theory and Recommender Systems: Analysis of the Axiomatic Foundations of Collaborative Filtering

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
An Overview and Comparison of Voting Methods for Pattern Recognition

IWFHR '02 Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
When are elections with few candidates hard to manipulate?

Journal of the ACM (JACM)
Anyone but him: The complexity of precluding an alternative

Artificial Intelligence
A broader picture of the complexity of strategic behavior in multi-winner elections

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Parameterized computational complexity of control problems in voting systems

Theoretical Computer Science
Llull and copeland voting broadly resist bribery and control

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Multi-agent planning as a dynamic search for social consensus

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Parameterized complexity of candidate control in elections and related digraph problems

Theoretical Computer Science
How hard is bribery in elections?

Journal of Artificial Intelligence Research
Multimode control attacks on elections

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
How hard is it to control an election?

Mathematical and Computer Modelling: An International Journal

Multimode control attacks on elections

Journal of Artificial Intelligence Research
Studies in computational aspects of voting: open problems of downey and fellows

The Multivariate Algorithmic Revolution and Beyond
Note: Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems

Theoretical Computer Science
Normalized Range Voting Broadly Resists Control

Theory of Computing Systems
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.89

Visualization

Abstract

Elections are a central model in a variety of areas. This paper studies parameterized computational complexity of five control problems in the Maximin election. We obtain the following results: constructive control by adding candidates is W[2]-hard with respect to the parameter ''number of added candidates''; both constructive and destructive control by adding/deleting voters are W[1]-hard with respect to the parameter ''number of added/deleted voters''.