Threshold dominating sets and an improved characterization of W[2]
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Algorithms for the coalitional manipulation problem
Artificial Intelligence
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
How similarity helps to efficiently compute Kemeny rankings
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Graphs, Networks and Algorithms
Graphs, Networks and Algorithms
Nonexistence of voting rules that are usually hard to manipulate
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
The complexity of bribery in elections
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Llull and copeland voting broadly resist bribery and control
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Approximability of manipulating elections
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Junta distributions and the average-case complexity of manipulating elections
Journal of Artificial Intelligence Research
Complexity of strategic behavior in multi-winner elections
Journal of Artificial Intelligence Research
Complexity of unweighted coalitional manipulation under some common voting rules
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
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Some Parameterized Problems On Digraphs
The Computer Journal
Fixed-parameter algorithms for Kemeny rankings
Theoretical Computer Science
Parameterized complexity of control problems in Maximin election
Information Processing Letters
On making a distinguished vertex minimum degree by vertex deletion
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Multimode control attacks on elections
Journal of Artificial Intelligence Research
On Bounded-Degree Vertex Deletion parameterized by treewidth
Discrete Applied Mathematics
Is computational complexity a barrier to manipulation?
Annals of Mathematics and Artificial Intelligence
Cloning in elections: finding the possible winners
Journal of Artificial Intelligence Research
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Discrete Applied Mathematics
| Hi-index | 5.23 |
There are different ways for an external agent to influence the outcome of an election. We concentrate on ''control'' by adding or deleting candidates. Our main focus is to investigate the parameterized complexity of various control problems for different voting systems. To this end, we introduce natural digraph problems that may be of independent interest. They help in determining the parameterized complexity of control for different voting systems including Llull, Copeland, and plurality voting. Devising several parameterized reductions, we provide an overview of the parameterized complexity of the digraph and control problems with respect to natural parameters such as adding/deleting only a bounded number of candidates or having only few voters.