Publications

Sort by  |  Author

Book Chapter

Control in Computational Social Choice.
J. Chen, J. Kaczmarek, P. Nüsken, J. Rothe, I. Schlotter, and T. Seeger.
Chapter in Mathematics and Artificial Intelligence, M. Golumbic and F. Hoffman (editors).
Springer Nature, Cham, Switzerland, to appear.

Refereed Journal Publications

How to Tamper with a Parliament: Strategic Campaigns in Apportionment Elections.
R. Bredereck, P. Faliszewski, M. Furdyna, A. Kaczmarczyk, J. Kaczmarek, M. Lackner, C. Laußmann, J. Rothe, and T. Seeger.
Journal of Computer and System Sciences, vol. 155, 103700, 2026.

Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games.
J. Kaczmarek, J. Rothe, and N. Talmon.
Journal of Artificial Intelligence Research, vol. 82, pp. 1077-1145, February 2025.

Controlling Weighted Voting Games by Deleting or Adding Players with or Without Changing the Quota.
J. Kaczmarek and J. Rothe.
Annals of Mathematics and Artificial Intelligence, vol. 92, no. 3, pp. 631-669, June 2024.

Refereed Publications in Conference Proceedings

Control by Deleting Players from Weighted Voting Games Is NPPP-Complete for the Penrose-Banzhaf Power Index.
J. Kaczmarek and J. Rothe.
Proceedings of the 28th European Conference on Artificial Intelligence (ECAI 2025), Bologna, Italy. IOS Press, Frontiers in Artificial Intelligence and Applications 392, pages 3663-3670, October 2025.

District-Limited Bribery in Multi-District Apportionment Elections with Threshold.
J. Kaczmarek, J. Rothe, and T. Seeger.
Proceedings of the 28th European Conference on Artificial Intelligence (ECAI 2025), Bologna, Italy. IOS Press, Frontiers in Artificial Intelligence and Applications 392, pages 3599-3606, October 2025.

Control in Computational Social Choice.
J. Chen, J. Kaczmarek, P. Nüsken, J. Rothe, I. Schlotter, and T. Seeger.
Proceedings of the 34th International Joint Conference on Artificial Intelligence (IJCAI 2025), Montréal, Quebéc, Canada. ijcai.org, pages 10391-10399, August 2025.

NPPP-Completeness of Control by Adding Players to Change the Penrose-Banzhaf Power Index in Weighted Voting Games (Extended Abstract).
J. Kaczmarek and J. Rothe.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2024), Auckland, New Zealand. IFAAMAS, pages 2318-2320, May 2024.

Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NPPP.
J. Kaczmarek and J. Rothe.
Proceedings of the 27th European Conference on Artificial Intelligence (ECAI 2024), Santiago de Compostela, Spain. IOS Press, Frontiers in Artificial Intelligence and Applications 392, pages 3525-3532, October 2024.

Complexity of Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games.
J. Kaczmarek, J. Rothe, and N. Talmon.
Proceedings of the 27th European Conference on Artificial Intelligence (ECAI 2023), Kraków, Poland. IOS Press, Frontiers in Artificial Intelligence and Applications 372, pages 1190-1197, September/October 2023.

Shapley Pruning for Interpretable Neural Network Compression.
K. Adamczewski, J. Kaczmarek, Y. Li, M. Magno, and L. Van Gool.
Proceedings of the 18th Asian Conference on Intelligent Information and Database Systems (ACIIDS 2026), Kaohsiung, Taiwan. Springer-Verlag Lecture Notes in Computer Science 16530, pages 17-32, April 2026.

Controlling Weighted Voting Games by Deleting or Adding Players with or Without Changing the Quota.
J. Kaczmarek and J. Rothe.
Proceedings of the 33rd International Workshop on Combinatorial Algorithms (IWOCA 2022), Trier, Germany. Springer-Verlag Lecture Notes in Computer Science 13270, pages 355-368, June 2022.
A preliminary version was presented at the 17th International Symposium on Artificial Intelligence and Mathematics (ISAIM 2022), Fort Lauderdale, FL, USA, virtual conference, January 2022.

Manipulation in Communication Structures of Graph-Restricted Weighted Voting Games.
J. Kaczmarek and J. Rothe.
Proceedings of the 7th International Conference on Algorithmic Decision Theory (ADT 2021), Toulouse, France. Springer-Verlag Lecture Notes in Artificial Intelligence 13023, pages 194-208, November 2021.

Technical Reports

How to Tamper with a Parliament: Strategic Campaigns in Apportionment Elections.
R. Bredereck, P. Faliszewski, M. Furdyna, A. Kaczmarczyk, J. Kaczmarek, M. Lackner, C. Laußmann, J. Rothe, and T. Seeger.
Technical Report arXiv:2601.15855v1 [cs.GT], ACM Computing Research Repository (CoRR), 56 pages, January 2026.

Control by Deleting Players from Weighted Voting Games Is NPPP-Complete for the Penrose-Banzhaf Power Index.
J. Kaczmarek and J. Rothe.
Technical Report arXiv:2508.13868v1 [cs.GT], ACM Computing Research Repository (CoRR), 25 pages, August 2025.

Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NPPP.
J. Kaczmarek and J. Rothe.
Technical Report arXiv:2408.09953v1 [cs.GT], ACM Computing Research Repository (CoRR), 24 pages, August 2024.

PhD Thesis

When Simple is Hard: Complexity Analysis of Structural Control in Weighted Voting Games and in Their Graph-Restricted Generalization.
J. Kaczmarek.
PhD Thesis. Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany, 223 pages, July 2025.