The possible winner with uncertain weights problem.
J. Comput. Syst. Sci., December, 2023
Complexity of shift bribery for iterative voting rules.
Ann. Math. Artif. Intell., 2022
Control complexity in Borda elections: Solving all open cases of offline control and some cases of online control.
Artif. Intell., 2021
Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters.
Auton. Agents Multi Agent Syst., 2021
The Possible Winner Problem with Uncertain Weights Revisited.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020
The Complexity of Cloning Candidates in Multiwinner Elections.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020
Complexity of Shift Bribery in Hare, Coombs, Baldwin, and Nanson Elections.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018
Complexity of Shift Bribery in Iterative Elections.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
Closing the Gap of Control Complexity in Borda Elections: Solving ten open cases.
Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017
Solving Seven Open Problems of Offline and Online Control in Borda Elections.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017