Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
When are elections with few candidates hard to manipulate?
Journal of the ACM (JACM)
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Uncertainty in preference elicitation and aggregation
AAAI'07 Proceedings of the 22nd 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
Determining possible and necessary winners under common voting rules given partial orders
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Winner determination in sequential majority voting
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Incompleteness and incomparability in preference aggregation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On the role of distances in defining voting rules
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
Journal of Computer and System Sciences
On problem kernels for possible winner determination under the k-approval protocol
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Multimode control attacks on elections
Journal of Artificial Intelligence Research
Possible winners when new alternatives join: new results coming up!
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Determining possible and necessary winners under common voting rules given partial orders
Journal of Artificial Intelligence Research
Winner determination in voting trees with incomplete preferences and weighted votes
Autonomous Agents and Multi-Agent Systems
Unweighted coalitional manipulation under the Borda rule Is NP-hard
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
A maximum likelihood approach towards aggregating partial orders
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
On the evaluation of election outcomes under uncertainty
Artificial Intelligence
Campaigns for lazy voters: truncated ballots
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Possible and necessary winners of partial tournaments
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
European Journal of Combinatorics
On the computation of fully proportional representation
Journal of Artificial Intelligence Research
The complexity of online manipulation of sequential elections
Journal of Computer and System Sciences
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
The POSSIBLE WINNER problem asks whether some distinguished candidate may become the winner of an election when the given incomplete votes are extended into complete ones in a favorable way. POSSIBLE WINNER is NP-complete for common voting rules such as Borda, many other positional scoring rules, Bucklin, Copeland etc. We investigate how three different parameterizations influence the computational complexity of POSSIBLE WINNER for a number of voting rules. We show fixed-parameter tractability results with respect to the parameter "number of candidates" but intractability results with respect to the parameter "number of votes". Finally, we derive fixed-parameter tractability results with respect to the parameter "total number of undetermined candidate pairs" and identify an interesting polynomial-time solvable special case for Borda.