Publications
] Combating Collusion Rings is Hard but Possible.
.
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), , 2022.
.
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), , 2022.
Accepted for publication.
On coalitional manipulation for multiwinner elections: shortlisting.
.
Autonomous Agents and Multi-Agent Systems 35:38 pages.
.
Autonomous Agents and Multi-Agent Systems 35:38 pages.
Complexity of Shift Bribery in Committee Elections.
.
ACM Transactions on Computation Theory 13:20:1--20:25.
.
ACM Transactions on Computation Theory 13:20:1--20:25.
Complexity of Manipulation in Premise-Based Judgment Aggregation with Simple Formulas.
.
In Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '19), pages 819–827, IFAAMAS, 2019.
.
In Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '19), pages 819–827, IFAAMAS, 2019.
On Coalitional Manipulation for Multiwinner Elections: Shortlisting.
.
In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 887-893, AAAI Press, 2017.
.
In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 887-893, AAAI Press, 2017.
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections.
.
In Proceedings of the 14th Annual Conference on Theory and Applications of Models of Computation (TAMC '17), pages 348–361, 2017.
.
In Proceedings of the 14th Annual Conference on Theory and Applications of Models of Computation (TAMC '17), pages 348–361, 2017.
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels.
.
In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI '16), pages 102-108, AAAI Press, 2016.
.
In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI '16), pages 102-108, AAAI Press, 2016.
Complexity of Shift Bribery in Committee Elections.
.
In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI '16), pages 2452--2458, AAAI Press, 2016.
.
In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI '16), pages 2452--2458, AAAI Press, 2016.
The Complexity of Degree Anonymization by Vertex Addition.
.
In Proceedings of the International Conference on Algorithmic Aspects of Information and Management (AAIM '14), volume 8546 of LNCS, pages 44–55, Springer, 2014.
.
In Proceedings of the International Conference on Algorithmic Aspects of Information and Management (AAIM '14), volume 8546 of LNCS, pages 44–55, Springer, 2014.
The complexity of finding a large subgraph under anonymity constraints.
.
Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC '13) LNCS 8283:152–162.
.
Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC '13) LNCS 8283:152–162.