Publications

Sort by  |  Author

2026

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.

2025

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.

Causes of Stability in Dynamic Coalition Formation.
N. Boehmer, M. Bullinger, and A. Kerkmann.
ACM Transactions on Economics and Computation, vol 13, no. 2, 6:1-6:45, April 2025.

2024

Playing, Voting, and Dividing.
J. Rothe.
Chapter 1 in Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, J. Rothe (editor), second edition, pp. 1-39.
Classroom Companion: Economics, Springer Nature, Cham, Switzerland, 2024.

Noncooperative Game Theory.
P. Faliszewski, I. Rothe, and J. Rothe.
Chapter 2 in Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, J. Rothe (editor), second edition, pp. 43-137.
Classroom Companion: Economics, Springer Nature, Cham, Switzerland, 2024.

Cooperative Game Theory.
M. Bullinger, E. Elkind, and J. Rothe.
Chapter 3 in Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, J. Rothe (editor), second edition, pp. 139-229.
Classroom Companion: Economics, Springer Nature, Cham, Switzerland, 2024.

Preference Aggregation by Voting.
D. Baumeister and J. Rothe.
Chapter 4 in Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, J. Rothe (editor), second edition, pp. 233-367.
Classroom Companion: Economics, Springer Nature, Cham, Switzerland, 2024.

The Complexity of Manipulative Actions in Single-Peaked Societies.
L. Hemaspaandra, E. Hemaspaandra, and J. Rothe.
Chapter 5 in Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, J. Rothe (editor), second edition, pp. 369-402.
Classroom Companion: Economics, Springer Nature, Cham, Switzerland, 2024.

Multiwinner Voting.
D. Baumeister, P. Faliszewski, J. Rothe, and P. Skowron.
Chapter 6 in Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, J. Rothe (editor), second edition, pp. 403-465.
Classroom Companion: Economics, Springer Nature, Cham, Switzerland, 2024.

Judgment Aggregation.
D. Baumeister, G. Erdélyi, R. de Haan, and J. Rothe.
Chapter 7 in Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, J. Rothe (editor), second edition, pp. 467-504.
Classroom Companion: Economics, Springer Nature, Cham, Switzerland, 2024.

Cake-Cutting: Fair Division of Divisible Goods.
C. Lindner and J. Rothe.
Chapter 8 in Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, J. Rothe (editor), second edition, pp. 507-603.
Classroom Companion: Economics, Springer Nature, Cham, Switzerland, 2024.

Fair Division of Indivisible Goods.
J. Lang and J. Rothe.
Chapter 9 in Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, J. Rothe (editor), second edition, pp. 605-680.
Classroom Companion: Economics, Springer Nature, Cham, Switzerland, 2024.

Stability, Vertex Stability, and Unfrozenness for Special Graph Classes.
F. Gurski, J. Rothe, and R. Weishaupt.
Theory of Computing Systems, vol. 68, pp. 75-102, February 2024.

Altruism in Coalition Formation Games.
A. Kerkmann, S. Cramer, and J. Rothe.
Annals of Mathematics and Artificial Intelligence, vol. 92, no. 3, pp. 601-629, June 2024.

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.

The Complexity of Verifying Popularity and Strict Popularity in Altruistic Hedonic Games.
A. Kerkmann and J. Rothe.
Journal of Autonomous Agents and Multi-Agent Systems, vol. 38, no. 2, Article 47, October 2024.

Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode.
C. Laußmann, J. Rothe, and T. Seeger.
Proceedings of the 49th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2024), Cochem, Germany. Springer-Verlag Lecture Notes in Computer Science 14519, pages 355-368, February 2024.

Core Stability in Altruistic Coalition Formation Games.
M. Hoffjan, A. Kerkmann, and J. Rothe.
Proceedings of the 16th Latin American Theoretical Informatics Symposium (LATIN 2024), Puerto Varas, Chile. Springer-Verlag Lecture Notes in Computer Science 14579, pages 320-333, March 2024.

Toward Completing the Picture of Control in Schulze and Ranked Pairs Elections.
C. Maushagen, D. Niclaus, P. Nüsken, J. Rothe, and T. Seeger.
Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI 2024), Jeju, South Korea. ijcai.org, pages 2940-2948, August 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 and Approximation Schemes for Social Welfare Maximization in the High-Multiplicity Setting.
T. Nguyen, K. Elbassioni, 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 3324-3331, October 2024.

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.

Complexity of Candidate Control for Single Nontransferable Vote and Bloc Voting.
G. Karh Bet, J. Rothe, and R. Zorn.
Proceedings of the 8th International Conference on Algorithmic Decision Theory (ADT 2024), Rutgers University, Piscataway, NJ, USA. Springer-Verlag Lecture Notes in Artificial Intelligence 15248, pages 3-17, October 2024.

Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division.
J. Rothe (editor).
Second edition. Classroom Companion: Economics, Springer Nature, Cham, Switzerland, xxiv+766 pages, 2024.
Authors: J. Rothe (Chapter 1); P. Faliszewski, I. Rothe, and J. Rothe (Chapter 2); M. Bullinger, E. Elkind, and J. Rothe (Chapter 3); D. Baumeister and J. Rothe (Chapter 4); E. Hemaspaandra, L. Hemaspaandra, and J. Rothe (Chapter 5); D. Baumeister, P. Faliszewski, J. Rothe, and P. Skowron (Chapter 6): D. Baumeister, G. Erdélyi, R. de Haan, and J. Rothe (Chapter 7); C. Lindner and J. Rothe (Chapter 8); J. Lang and J. Rothe (Chapter 9).

2023

Fair and Efficient Allocation with Few Agent Types, Few Item Types, or Small Value Levels.
T. Nguyen and J. Rothe.
Artificial Intelligence, vol. 314, 103820, January 2023.

The Possible Winner Problem with Uncertain Weights.
D. Baumeister, M. Neveling, M. Roos, J. Rothe, L. Schend, R. Weishaupt, and L. Xia.
Journal of Computer and System Sciences, vol. 138, 103464, December 2023.

Causes of Stability in Dynamic Coalition Formation.
N. Boehmer, M. Bullinger, and A. Kerkmann.
Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI 2023), Washington D.C., USA. AAAI Press, pages 5499-5506, February 2023.

Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey.
T. Nguyen and J. Rothe.
Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI 2023), Macao, SAR, China. ijcai.org, pages 6732-6740, August 2023.

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.

2022

Complexity of Stability.
F. Frei, L. Hemaspaandra, and J. Rothe.
Journal of Computer and System Sciences, vol. 123, pp. 103-121, February 2022.

The Complexity of Online Bribery in Sequential Elections.
L. Hemaspaandra, E. Hemaspaandra, and J. Rothe.
Journal of Computer and System Sciences, vol. 127, pp. 66-90, August 2022.

Complexity of Shift Bribery for Iterative Voting Rules.
C. Maushagen, M. Neveling, J. Rothe, and A. Selker.
Annals of Mathematics and Artificial Intelligence, vol. 90, no. 10, pp. 1017–1054, October 2022.

Altruistic Hedonic Games.
A. Kerkmann, N. Nguyen, L. Rey, A. Rey, J. Rothe, L. Schend, and A. Wiechers.
Journal of Artificial Intelligence Research, vol. 75, pp. 129-169, September 2022.

Voting for Centrality (Extended Abstract).
U. Brandes, C. Laußmann, and J. Rothe.
Proceedings of the 21th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022), Auckland, New Zealand, virtual conference. IFAAMAS, pages 1554-1556, May 2022.

Popularity and Strict Popularity in Altruistic Hedonic Games and Minimum-Based Altruistic Hedonic Games (Extended Abstract).
A. Kerkmann and J. Rothe.
Proceedings of the 21th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022), Auckland, New Zealand, virtual conference. IFAAMAS, pages 1657-1659, May 2022.

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.

2021

Collective Acceptability in Abstract Argumentation.
D. Baumeister, D. Neugebauer, and J. Rothe.
Chapter 4 in Handbook of Formal Argumentation, Volume 2, D. Gabbay, M. Giacomin, G. Simari, and M. Thimm (editors), pp. 249-297.
College Publications, London, UK, 2021.

Improved Bi-Criteria Approximation Schemes for Load Balancing on Unrelated Machines with Cost Constraints.
T. Nguyen and J. Rothe.
Theoretical Computer Science, vol. 858, pp. 35-48, February 2021.

Complexity of Nonempty Existence Problems in Incomplete Argumentation Frameworks.
K. Skiba, D. Neugebauer, and J. Rothe.
IEEE Intelligent Systems, vol. 36, no. 2, pp. 13-24, March/April 2021.

Acceptance in Incomplete Argumentation Frameworks.
D. Baumeister, M. Järvisalo, D. Neugebauer, A. Niskanen, and J. Rothe.
Artificial Intelligence, vol. 295, 103470, 35 pages, June 2021.

Local Fairness in Hedonic Games via Individual Threshold Coalitions.
A. Kerkmann, N. Nguyen, and J. Rothe.
Theoretical Computer Science, vol. 877, pp. 1-17, July 2021.

Control Complexity in Borda Elections: Solving All Open Cases of Offline Control and Some Cases of Online Control.
M. Neveling and J. Rothe.
Artificial Intelligence, vol. 298, 103508, 30 pages, September 2021.

Collective Acceptability in Abstract Argumentation.
D. Baumeister, D. Neugebauer, and J. Rothe.
Journal of Applied Logics, vol. 8, no. 6, pp. 1503-1542, July 2021.
Appears also as a chapter in Handbook of Formal Argumentation, Volume 2, edited by D. Gabbay, M. Giacomin, G. Simari, and M. Thimm.

Towards Completing the Puzzle: Complexity of Control by Replacing, Adding, and Deleting Candidates or Voters.
G. Erdélyi, M. Neveling, C. Reger, J. Rothe, Y. Yang, and R. Zorn.
Journal of Autonomous Agents and Multi-Agent Systems, vol. 35, no. 2, article 41, July 2021.

Thou Shalt Love Thy Neighbor as Thyself When Thou Playest: Altruism in Game Theory.
J. Rothe.
Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021), virtual conference. AAAI Press, pages 15070-15077, February 2021.

Complexity of Sequential Rules in Judgment Aggregation.
D. Baumeister, L. Boes, and R. Weishaupt.
Proceedings of the 20th Conference on Autonomous Agents and Multiagent Systems (AAMAS 2021), London, UK. IFAAMAS, pages 187-195, May 2021.

A Closer Look at the Cake-Cutting Foundations through the Lens of Measure Theory.
P. Kern, D. Neugebauer, J. Rothe, R. Schilling, D. Stoyan, and R. Weishaupt.
Nonarchival proceedings of the 8th International Workshop on Computational Social Choice (COMSOC 2021), Technion, Haifa, Israel, June 2021.

Four Faces of Altruistic Hedonic Games.
A. Kerkmann and J. Rothe.
Nonarchival proceedings of the 8th International Workshop on Computational Social Choice (COMSOC 2021), Technion, Haifa, Israel, June 2021.

Complexity of Nonemptiness in Control Argumentation Frameworks.
D. Neugebauer, J. Rothe, and K. Skiba.
Proceedings of the 16th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2021), Prague, Czech Rebublic. Springer-Verlag Lecture Notes in Artificial Intelligence 12897, pages 117-129, September 2021.

The Possible Winner Problem with Uncertain Weights Revisited.
M. Neveling, J. Rothe, and R. Weishaupt.
Proceedings of the 23rd International Symposium on Fundamentals of Computation Theory (FCT 2021), Athens, Greece. Best Paper Award. Springer-Verlag Lecture Notes in Computer Science 12867, pages 399-412, September 2021.

Stability of Special Graph Classes.
R. Weishaupt and J. Rothe.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science (ICTCS 2021), Bologna, Italy. CEUR-WS.org, vol. 3072, paper 20, September 2021.

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.

2020

The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters.
M. Neveling, J. Rothe, and R. Zorn.
Proceedings of the 15th International Computer Science Symposium in Russia (CSR 2020), Ekaterinburg, Russia. Springer-Verlag Lecture Notes in Computer Science 12159, pages 314-327, June/July 2020.
A preliminary version appeared in the nonarchival website proceedings of the 16th International Symposium on Artificial Intelligence and Mathematics (ISAIM 2020), Fort Lauderdale, FL, USA. January 2020.

Altruism in Coalition Formation Games.
A. Kerkmann and J. Rothe.
Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), Yokohama, Japan. ijcai.org, pages 347-353, July 2020.
A preliminary version appeared in the nonarchival website proceedings of the 16th International Symposium on Artificial Intelligence and Mathematics (ISAIM 2020), Fort Lauderdale, FL, USA. January 2020.

Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types.
T. Nguyen and J. Rothe.
Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), Yokohama, Japan. ijcai.org, pages 290-296, July 2020.

Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs.
T. Nguyen and J. Rothe.
Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020), virtual conference. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, LIPIcs, vol. 181, pages 14:1-14:14, December 2020.

Complexity of Stability.
F. Frei, L. Hemaspaandra, and J. Rothe.
Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020), virtual conference. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, LIPIcs, vol. 181, pages 19:1-19:14, December 2020.