A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
Computing small partial coverings
Information Processing Letters
SIAM Journal on Discrete Mathematics
The turing way to parameterized complexity
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
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
Uncertainty in preference elicitation and aggregation
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
How hard is bribery in elections?
Journal of Artificial Intelligence Research
A multivariate complexity analysis of determining possible winners given incomplete votes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Preference aggregation over restricted ballot languages: sincerity and strategy-proofness
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Manipulation of copeland elections
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Using complexity to protect elections
Communications of the ACM
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
Journal of Computer and System Sciences
Practical voting rules with partial information
Autonomous Agents and Multi-Agent Systems
Approximation algorithms for campaign management
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Possible and necessary winners in voting trees: majority graphs vs. profiles
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Possible winners when new alternatives join: new results coming up!
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Computational complexity of two variants of the possible winner problem
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
Cloning in elections: finding the possible winners
Journal of Artificial Intelligence Research
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
Robust approximation and incremental elicitation in voting protocols
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
| Hi-index | 0.00 |
We study elections in which voters may submit partial ballots consisting of truncated lists: each voter ranks some of her top candidates (and possibly some of her bottom candidates) and is indifferent among the remaining ones. Holding elections with such votes requires adapting classical voting rules (which expect complete rankings as input) and these adaptations create various opportunities for candidates who want to increase their chances of winning. We provide complexity results regarding planning various kinds of campaigns in such settings, and we study the complexity of the possible winner problem for the case of truncated votes.