Publications

Sort by  |  Author

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.

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.

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.

US2RO: Union of Superpoints to Recognize Objects.
M. Tiator, A. Kerkmann, C. Geiger, and P. Grimm.
International Journal of Semantic Computing, vol. 15, no. 4, pp. 513-537, December 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.

2020

Complexity of Possible and Necessary Existence Problems in Abstract Argumentation.
K. Skiba, D. Neugebauer, and J. Rothe.
Proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), Santiago de Compostela, Spain. IOS Press, Frontiers in Artificial Intelligence and Applications 325, pages 897-904, August/September 2020.

Manipulation of Opinion Polls to Influence Iterative Elections.
D. Baumeister, A. Selker, and A. Wilczynski.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020), Auckland, New Zealand. IFAAMAS, pages 132-140, May 2020.

Irresolute Approval-Based Budgeting (Extended Abstract).
D. Baumeister, L. Boes, and T. Seeger.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020), Auckland, New Zealand. IFAAMAS, pages 1774-1776, May 2020.

Complexity of Election Evaluation and Probabilistic Robustness (Extended Abstract).
D. Baumeister and T. Hogrebe.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020), Auckland, New Zealand. IFAAMAS, pages 1771-1773, May 2020.

2018

Verification in Incomplete Argumentation Frameworks.
D. Baumeister, D. Neugebauer, J. Rothe, and H. Schadrack.
Artificial Intelligence, vol. 264, pp. 1-26, November 2018.

Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks.
D. Baumeister, D. Neugebauer, and J. Rothe.
Proceedings of the 7th International Conference on Computational Models of Argument (COMMA 2018), Warsaw, Poland. IOS Press, pages 181-192, September 2018.

2017

Strategic Behavior in Judgment Aggregation.
D. Baumeister, J. Rothe, and A. Selker.
Chapter 8 in Trends in Computational Social Choice, U. Endriss (editor), pp. 145-168. AI Access Foundation, 2017.

The Complexity of Online Voter Control in Sequential Elections.
L. Hemaspaandra, E. Hemaspaandra, and J. Rothe.
Journal of Autonomous Agents and Multi-Agent Systems, vol. 31, no. 5, pp. 1055-1076, September 2017.

The Complexity of Controlling Candidate-Sequential Elections.
L. Hemaspaandra, E. Hemaspaandra, and J. Rothe.
Theoretical Computer Science, vol. 678, pp. 14-21, May 2017.

Solving Seven Open Problems of Offline and Online Control in Borda Elections.
M. Neveling and J. Rothe.
Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), San Francisco, CA, USA. AAAI Press, pages 3029-3035, February 2017.
An extended version also appears in the nonarchival proceedings of the 7th International Workshop on Computational Social Choice (COMSOC 2018), Troy, NY, USA, June 2018.

Generating Defeasible Knowledge Bases from Real-World Argumentations using D-BAS.
D. Neugebauer.
Proceedings of the 1st Workshop on Advances in Argumentation in Artificial Intelligence (AI^3 2017), Bari, Italy. CEUR-WS.org, vol. 2012, pp. 105-110, November 2017.

2016

Complexity of Control by Partitioning Veto and Maximin Elections and of Control by Adding Candidates to Plurality Elections.
C. Maushagen and J. Rothe.
Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016), The Hague, The Netherlands. IOS Press, pages 277-285, August/September 2016.
A preliminary version appeared in the nonarchival website proceedings of the 14th International Symposium on Artificial Intelligence and Mathematics (ISAIM 2016), Fort Lauderdale, FL, USA. January 2016.

2015

Control Complexity in Bucklin and Fallback Voting: A Theoretical Analysis.
G. Erdélyi, M. Fellows, J. Rothe, and L. Schend.
Journal of Computer and System Sciences, vol. 81, no. 4, pp. 632-660, June 2015.

Control Complexity in Bucklin and Fallback Voting: An Experimental Analysis.
G. Erdélyi, M. Fellows, J. Rothe, and L. Schend.
Journal of Computer and System Sciences, vol. 81, no. 4, pp. 661-670, June 2015.

Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting.
P. Faliszewski, Y. Reisch, J. Rothe, and L. Schend.
Journal of Autonomous Agents and Multi-Agent Systems, vol. 29, no. 6, pp. 1091-1124, November 2015.

Complexity of Manipulation and Bribery in Judgment Aggregation for Uniform Premise-Based Quota Rules.
D. Baumeister, G. Erdélyi, O. Erdélyi, and J. Rothe.
Mathematical Social Sciences, vol. 76, pp. 19-30, July 2015.

Voter Dissatisfaction in Committee Elections (Extended Abstract).
D. Baumeister and S. Dennisen.
Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2015), Istanbul, Turkey. IFAAMAS, pages 1707-1708, May 2015.

Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types.
D. Baumeister, J. Rothe, and A. Selker.
Proceedings of the 4th International Conference on Algorithmic Decision Theory (ADT 2015), Lexington, KY, USA. Springer-Verlag Lecture Notes in Artificial Intelligence 9346, pages 432-448, September 2015.

Verification in Attack-Incomplete Argumentation Frameworks.
D. Baumeister, D. Neugebauer, and J. Rothe.
Proceedings of the 4th International Conference on Algorithmic Decision Theory (ADT 2015), Lexington, KY, USA. Springer-Verlag Lecture Notes in Artificial Intelligence 9346, pages 341-358, September 2015.
Appears also in the nonarchival proceedings of the 6th International Workshop on Computational Social Choice (COMSOC 2016), Toulouse, France, June 2016.

Verification in Argument-Incomplete Argumentation Frameworks.
D. Baumeister, J. Rothe, and H. Schadrack.
Proceedings of the 4th International Conference on Algorithmic Decision Theory (ADT 2015), Lexington, KY, USA. Springer-Verlag Lecture Notes in Artificial Intelligence 9346, pages 359-376, September 2015.
Appears also in the nonarchival proceedings of the 6th International Workshop on Computational Social Choice (COMSOC 2016), Toulouse, France, June 2016.

Winner Determination and Manipulation in Minisum and Minimax Committee Elections.
D. Baumeister, S. Dennisen, and L. Rey.
Proceedings of the 4th International Conference on Algorithmic Decision Theory (ADT 2015), Lexington, USA. Springer-Verlag Lecture Notes in Artificial Intelligence 9346, pages 469-485, September 2015.

Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division.
J. Rothe (editor).
Springer Texts in Business and Economics, Springer-Verlag, Berlin, Heidelberg, xii+612 pages, 2015.
Authors: J. Rothe (Chapter 1), P. Faliszewski, I. Rothe, and J. Rothe (Chapter 2), 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, G. Erdélyi, and J. Rothe (Chapter 6), C. Lindner and J. Rothe (Chapter 7), J. Lang and J. Rothe (Chapter 8).

2014

The Complexity of Online Manipulation of Sequential Elections.
L. Hemaspaandra, E. Hemaspaandra, and J. Rothe.
Journal of Computer and System Sciences, vol. 80, no. 4, pp. 697-710, June 2014.

False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time.
A. Rey and J. Rothe.
Journal of Artificial Intelligence Research, vol. 50, pp. 573-601, July 2014.