List of Publications
Here are some further links to a database
containing also old technical reports and the complete publication list
of our group:
Jörg Rothe's publications
sorted by type of publication
|
sorted by year.
Publications of the Düsseldorf Computational Complexity and Cryptology group
sorted by type of publication
|
sorted by year.
Jörg Rothe's DBLP entry
(which is a bit hard to find due to the Umlaut in my name).
Books (authored, co-authored, edited, or co-edited)
-
Proceedings of the 5th International Conference on
Algorithmic Decision Theory.
-
J. Rothe (editor).
- Springer-Verlag Lecture Notes in Artificial Intelligence
10576, xxiii+390 pp., 2017.
-
Economics and Computation. An Introduction to Algorithmic Game
Theory, Computational Social Choice, and Fair Division.
-
J. Rothe (editor and co-author).
- Springer Texts in Business and Economics, Springer-Verlag,
Berlin, Heidelberg, xii+612 pp., 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).
-
Einführung in Computational Social Choice: Individuelle Strategien
und kollektive Entscheidungen beim Spielen, Wählen und Teilen.
-
J. Rothe,
D. Baumeister, C. Lindner, and I. Rothe.
- Spektrum Akademischer Verlag, Heidelberg, xii+375 pp., 2011.
-
Exakte Algorithmen für schwere Graphenprobleme.
-
F. Gurski, I. Rothe,
J. Rothe, and E. Wanke.
- eXamen.press, Springer-Verlag, Berlin, Heidelberg, xii+331 pp., 2010.
-
Proceedings of the Third International Workshop on Computational Social
Choice.
-
V. Conitzer and
J. Rothe (editors).
- Printed by Düsseldorf University Press.
University of Düsseldorf, Germany, viii+495 pp., September 2010.
-
Komplexitätstheorie und Kryptologie. Eine Einführung in Kryptokomplexität.
-
J. Rothe.
- eXamen.press, Springer-Verlag, Berlin, Heidelberg, xii+535 pp., 2008.
-
Complexity Theory and Cryptology. An Introduction to Cryptocomplexity.
-
J. Rothe.
- EATCS Texts in Theoretical Computer Science, Springer-Verlag,
Berlin, Heidelberg, xii+478 pp., 2005.
Refereed Journal Publications
-
Fair and Efficient Allocation with Few Agent Types, Few Item Types, or Small Value Levels.
-
T. Nguyen and
J. Rothe.
- To appear in Artificial Intelligence.
-
Complexity of Shift Bribery for Iterative Voting Rules.
-
C. Maushagen, M. Neveling,
J. Rothe,
and A. Selker.
- To appear in Annals of Mathematics and Artificial Intelligence.
-
Altruistic Hedonic Games.
-
A. Kerkmann, N. Nguyen, A. Rey, L. Rey,
J. Rothe,
L. Schend, and A . Wiechers.
- Journal of Artificial Intelligence Research, vol. 75,
pp. 129-169, September 2022.
-
The Complexity of Online Bribery in Sequential Elections.
-
E. Hemaspaandra, L. Hemaspaandra, and
J. Rothe.
- Journal of Computer and System Sciences, vol. 127, pp. 66-90,
August 2022.
-
Complexity of
Stability.
-
F. Frei, E. Hemaspaandra, and
J. Rothe.
- Journal of Computer and System Sciences, vol. 123, pp. 103-121,
February 2022.
-
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.
-
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.
-
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.
-
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.
-
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.
-
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 Control in Judgment Aggregation for Uniform
Premise-Based Quota Rules.
-
D. Baumeister, G. Erdélyi, O. Erdélyi,
J. Rothe,
and A. Selker.
- Journal of Computer and System Sciences, vol. 112,
pp. 13-33, September 2020.
-
Hedonic Games with Ordinal Preferences and Thresholds.
-
A. Kerkmann, J. Lang, A. Rey,
J. Rothe,
H. Schadrack, and L. Schend.
- Journal of Artificial Intelligence Research, vol. 67,
pp. 705-756, April 2020.
-
The Price to Pay for Forgoing Normalization in Fair Division of
Indivisible Goods.
-
P. Lange, N. Nguyen, and
J. Rothe.
- Annals of Mathematics and Artificial Intelligence, vol. 88,
no. 7, pp. 817-832, July 2020.
-
Duplication Monotonicity in the Allocation of Indivisible Goods.
-
B. Kuckuck and
J. Rothe.
- AI Communications, vol. 32, no. 4, pp. 253-270, October
2019.
-
Bounds on the Cost of Stabilizing a Cooperative Game.
-
Y. Bachrach, E. Elkind, E. Malizia, R. Meir, D. Pasechnik,
J. Rosenschein,
J. Rothe,
and M. Zuckerman.
- Journal of Artificial Intelligence Research, vol. 63,
pp. 987-1023, December 2018.
-
Borda-Induced Hedonic Games with Friends, Enemies, and Neutral Players.
-
J. Rothe,
H. Schadrack, and L. Schend.
- Mathematical Social Sciences,
vol. 96, pp. 21-36, November 2018.
-
Verification in Incomplete Argumentation Frameworks.
-
D. Baumeister, D. Neugebauer,
J. Rothe, and
H. Schadrack.
- Artificial Intelligence,
vol. 264, pp. 1-26, November 2018.
-
Approximation
and Complexity of the Optimization and Existence
Problems for Maximin Share, Proportional Share, and Minimax Share
Allocation of Indivisible Goods.
-
T. Heinen, N. Nguyen, T. Nguyen, and
J. Rothe.
- Journal of Autonomous Agents and Multi-Agent Systems,
vol. 32, no. 6, pp. 741-778, November 2018.
-
Structural Control in Weighted Voting Games.
-
A. Rey and
J. Rothe.
- The B.E. Journal of Theoretical Economics,
vol. 18, no. 2, July 2018.
-
Complexity
of Control by Partitioning Veto Elections and of Control by Adding
Candidates to Plurality Elections.
-
C. Maushagen and
J. Rothe.
- Annals of Mathematics and Artificial Intelligence, vol. 82,
no. 4, pp. 219-244, April 2018.
-
Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods.
-
N. Nguyen,
D. Baumeister, and
J. Rothe.
- Social Choice and Welfare,
vol. 50, no. 1, pp. 101-122, January 2018.
-
The Complexity of Online Voter Control in Sequential Elections.
-
E. Hemaspaandra,
L. 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.
-
E. Hemaspaandra,
L. Hemaspaandra, and
J. Rothe.
- Theoretical Computer Science, vol. 678, pp. 14-21, May
2017.
-
Positional Scoring-Based Allocation of Indivisible Goods.
-
D. Baumeister, S. Bouveret, J. Lang, N. Nguyen, T. Nguyen,
J. Rothe, and
A. Saffidine.
- Journal of Autonomous Agents and Multi-Agent Systems,
vol. 31, no. 3, pp. 628-655, May 2017.
-
Path-Disruption Games: Bribery and a Probabilistic Model.
-
A. Rey,
J. Rothe,
and
A. Marple.
- Theory of Computing Systems, vol. 60, no. 2, pp. 222-252,
February 2017.
-
Toward the Complexity of the Existence of Wonderfully Stable
Partitions and Strictly Core Stable Coalition Structures in
Enemy-Oriented Hedonic Games.
-
A. Rey,
J. Rothe,
H. Schadrack, and
L. Schend.
- Annals of Mathematics and Artificial Intelligence, vol. 77,
no. 3-4, pp. 317-333, August 2016.
-
A Statistical Approach to Calibrating the Scores of Biased
Reviewers of Scientific Papers.
-
W. Kuhlisch, M. Roos,
J. Rothe,
J. Rudolph, B. Scheuermann, and D. Stoyan.
- Metrika, vol. 79, no. 1, pp. 37-57, January 2016.
-
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.
-
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.
-
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.
-
Minimizing Envy and Maximizing Average Nash Social Welfare in
the Allocation of Indivisible Goods.
-
T. Nguyen and
J. Rothe.
- Discrete Applied Mathematics, vol. 179,
pp. 54-68, December 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.
-
The Complexity of Online Manipulation of Sequential Elections.
-
E. Hemaspaandra,
L. Hemaspaandra,
and
J. Rothe.
- Journal of Computer and System Sciences, vol. 80,
no. 4, pp. 697-710, June 2014.
-
Computational Complexity and Approximability of Social Welfare
Optimization in Multiagent Resource Allocation.
-
N. Nguyen, T. Nguyen, M. Roos, and
J. Rothe.
- Journal of Autonomous Agents and Multi-Agent Systems, vol. 28,
no. 2, pp. 256-289, March 2014.
-
The Complexity of Probabilistic Lobbying.
-
D. Binkele-Raible, G. Erdélyi, H. Fernau,
J. Goldsmith,
N. Mattei,
and
J. Rothe.
- Discrete Optimization, vol. 11,
no. 1, pp. 1-21, February 2014.
-
Challenges to Complexity Shields That Are Supposed to Protect
Elections Against Manipulation and Control: A Survey.
-
J. Rothe and
L. Schend.
- Annals of Mathematics and Artificial Intelligence, vol. 68,
no. 1-3, pp. 161-193, May-July 2013.
-
A Survey of Approximability and Inapproximability Results for
Social Welfare Optimization in Multiagent Resource Allocation.
-
T. Nguyen, M. Roos, and
J. Rothe.
- Annals of Mathematics and Artificial Intelligence, vol. 68,
no. 1-3, pp. 65-90, May-July 2013.
-
The Complexity of Computing Minimal Unidirectional Covering Sets.
-
D. Baumeister,
F. Brandt,
F. Fischer,
J. Hoffmann, and
J. Rothe.
- Theory of Computing Systems, vol. 53, no. 3,
pp. 467-502, October 2013.
-
Taking the Final Step to a Full Dichotomy of the Possible Winner
Problem in Pure Scoring Rules.
- D. Baumeister
and
J. Rothe.
-
Information Processing Letters, vol. 112, no. 5,
pp. 186-190, February 2012.
-
The Shield that Never Was: Societies with Single-Peaked
Preferences are More Open to Manipulation and Control.
-
P. Faliszewski,
E. Hemaspaandra,
L. Hemaspaandra,
and
J. Rothe.
-
Information and Computation, vol. 209, no. 2,
pp. 89-107, February 2011.
-
Generalized Juntas and NP-Hard Sets.
- G. Erdélyi,
L. Hemaspaandra,
J. Rothe, and H. Spakowski.
-
Theoretical Computer Science, vol. 410, no. 38-40,
pp. 3995-4000, September 2009.
-
Frequency of Correctness versus Average Polynomial Time.
- G. Erdélyi,
L. Hemaspaandra,
J. Rothe, and H. Spakowski.
-
Information Processing Letters, vol. 109, no. 16, pp. 946-949,
July 2009.
-
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems
are NP-Complete via Parsimonious Reductions.
- D. Baumeister and J. Rothe.
- Information and Computation, vol. 207, no. 11, pp.
1119-1139, November 2009.
-
Llull and Copeland Voting Computationally Resist Bribery and Constructive
Control.
-
P. Faliszewski, E. Hemaspaandra,
L. Hemaspaandra,
and
J. Rothe.
-
Journal of Artificial Intelligence Research, vol. 35, pp.
275-341, June 2009.
-
Sincere-Strategy Preference-Based Approval Voting Fully Resists
Constructive Control and Broadly Resists Destructive Control.
- G. Erdélyi, M. Nowak, and J. Rothe.
-
Mathematical Logic Quarterly, vol. 55, no. 4, pp. 425-443,
August 2009.
-
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control.
-
E. Hemaspaandra,
L. Hemaspaandra,
and
J. Rothe.
-
Mathematical Logic Quarterly, vol. 55, no. 4, pp. 397-424,
August 2009.
- Satisfiability Parsimoniously Reduces to the Tantrix(TM)
Rotation Puzzle Problem.
-
D. Baumeister and
J. Rothe.
- Fundamenta Informaticae, vol. 91, no. 1, pp. 35-51, January
2009.
-
Enforcing and Defying Associativity, Commutativity,
Totality, and Strong Noninvertibility for One-Way Functions in
Complexity Theory.
-
L. Hemaspaandra,
J. Rothe, and
A. Saxena.
- Theoretical Computer Science,
vol. 401, no. 1-3, pp. 27-35, July 2008.
-
Quantum Cryptography: A Survey.
- D. Bruss, G. Erdélyi, T. Meyer, T. Riege, and
J. Rothe.
- ACM Computing Surveys, vol. 39, no. 2, article 6, 27 pp.,
June 2007.
-
Anyone but Him: The Complexity of Precluding an Alternative.
- E. Hemaspaandra,
L. Hemaspaandra,
and J. Rothe.
- Artificial Intelligence, vol. 171, no. 5-6, pp. 255-285,
April 2007.
-
An Improved Exact Algorithm for the Domatic Number Problem.
- T. Riege, J. Rothe, H. Spakowski, and
M. Yamamoto.
- Information Processing Letters,
vol. 101, no. 3, pp. 101-106, February 2007.
-
If P ≠ NP then Some Strongly Noninvertible Functions are
Invertible.
-
L. Hemaspaandra,
K. Pasanen, and
J. Rothe.
- Theoretical Computer Science,
vol. 362, no. 1-3, pp. 54-62, October 2006.
-
On Computing the Smallest Four-Coloring of Planar Graphs and
Non-Self-Reducible Sets in P.
- A. Große,
J. Rothe, and
G. Wechsung.
- Information Processing Letters,
vol. 99, no. 6, pp. 215-221, September 2006.
-
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor
Flow Shop Problem.
-
T. Riege and J. Rothe.
- Theory of Computing Systems,
vol. 39, no. 5, pp. 635-668, September 2006.
-
Completeness in the Boolean Hierarchy: Exact-Four-Colorability,
Minimal Graph Uncolorability, and Exact Domatic Number Problems - a
Survey.
- T. Riege and J. Rothe.
- Journal of Universal Computer Science,
vol. 12, no. 5, pp. 551-578, May 2006.
-
Recognizing When Heuristics Can Approximate Minimum Vertex Covers
Is Complete for Parallel Access to NP.
- E. Hemaspaandra,
J. Rothe, and
H. Spakowski.
- R.A.I.R.O. Theoretical Informatics and Applications,
vol. 40, no. 1, pp. 75-91, January 2006.
-
Exact Complexity of Exact-Four-Colorability.
- J. Rothe.
- Information Processing Letters, vol. 87, no. 1,
pp. 7-12, July 2003.
-
Exact Complexity of the Winner Problem for Young Elections.
-
J. Rothe, H. Spakowski, and J. Vogel.
- Theory of Computing Systems, vol. 36, no. 4,
pp. 375-386, June 2003.
-
Some Facets of Complexity Theory and Cryptography:
A Five-Lecture Tutorial.
- J. Rothe.
- ACM Computing Surveys, vol. 34,
no. 4, pp. 504-549, December 2002.
-
On Characterizing the Existence of Partial One-Way Permutations.
- J. Rothe and
L. Hemaspaandra.
- Information Processing Letters, vol. 82, no. 3,
pp. 165-171, May 2002.
-
Kryptographische Protokolle und Null-Information.
- J. Rothe.
- Informatik Spektrum, vol. 25, no. 2,
pp. 120-131, April 2002.
In German.
- Appears also in:
Jahrbuch der Heinrich-Heine-Universität
Düsseldorf 2001, pp. 183-201, Düsseldorf, Germany, 2001.
-
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from
Partial Ones.
-
A. Große,
J. Rothe, and
G. Wechsung.
- Theory of Computing Systems, vol. 35, no. 1,
pp. 81-93, February 2002.
-
Characterizing the Existence of One-Way Permutations.
-
L. Hemaspaandra
and J. Rothe.
- Theoretical Computer Science, vol. 244, no. 1-2,
pp. 257-261, August 2000.
-
A Second Step Towards Complexity-Theoretic Analogs of
Rice's Theorem.
-
L. Hemaspaandra
and J. Rothe.
- Theoretical Computer Science, vol. 244, no. 1-2,
pp. 205-217, August 2000.
-
Tally NP Sets and Easy Census Functions.
-
J. Goldsmith,
M. Ogihara,
and J. Rothe.
- Information and Computation,
vol. 158, no. 1, pp. 29-52, April 2000.
-
Restrictive Acceptance Suffices for Equivalence Problems.
-
B. Borchert,
L. Hemaspaandra,
and J. Rothe.
- London Mathematical Society Journal of Computation
and Mathematics, vol. 3, pp. 86-95, March 2000.
-
Heuristics versus Completeness for Graph Coloring.
- J. Rothe.
- Chicago Journal of Theoretical Computer Science, vol. 2000,
article 1, 16 pages, February 2000.
-
Creating Strong, Total, Commutative, Associative One-Way
Functions from Any One-Way Function in Complexity Theory.
-
L. Hemaspaandra
and J. Rothe.
- Journal of Computer and System Sciences,
vol. 58, no. 3, pp. 648-659, June 1999.
-
Immunity and Simplicity for Exact Counting and Other
Counting Classes.
- J. Rothe.
- R.A.I.R.O. Theoretical Informatics and Applications,
vol. 33, no. 2, pp. 159-176, March/April 1999.
-
Boolean Operations, Joins, and the Extended Low Hierarchy.
-
L. Hemaspaandra,
Z. Jiang, J. Rothe, and
O. Watanabe.
- Theoretical Computer Science, vol. 205, no. 1-2,
pp. 317-327, September 1998.
-
Recognizing When Greed Can Approximate Maximum Independent Sets is
Complete for Parallel Access to NP.
- E. Hemaspaandra and J. Rothe.
- Information Processing Letters, vol. 65, no. 3,
pp. 151-156, February 1998.
-
Exact Analysis of Dodgson Elections: Lewis Carroll's 1876
Voting System is Complete for Parallel Access to NP.
- E. Hemaspaandra,
L. Hemaspaandra,
and J. Rothe.
- Journal of the Association for Computing Machinery, vol. 44,
no. 6, pp. 806-825, November 1997.
-
Easy Sets and Hard Certificate Schemes.
-
L. Hemaspaandra,
J. Rothe, and
G. Wechsung.
- Acta Informatica, vol. 34, no. 11, pp. 859-879, November 1997.
-
Unambiguous Computation: Boolean Hierarchies and Sparse
Turing-Complete Sets.
-
L. Hemaspaandra
and J. Rothe.
- SIAM Journal on Computing, vol. 26, no. 3,
pp. 634-653, June 1997.
-
Polynomial-Time Multi-Selectivity.
-
L. Hemaspaandra,
Z. Jiang, J. Rothe, and
O. Watanabe.
- Journal of Universal Computer Science, vol. 3, no. 3,
pp. 197-229, March 1997.
-
Upward Separation for FewP and Related Classes.
-
R. Rao,
J. Rothe, and
O. Watanabe.
- Information Processing Letters, vol. 52, no. 4,
pp. 175-180, November 1994.
-
Corrigendum
appears in the same journal,
vol. 74, no. 1-2, p. 89, April 2000.
- A Note on the Polynomial-Time Hierarchy and Probabilistic
Operators.
- J. Rothe and J. Vogel.
- Computers and Artificial Intelligence, vol. 13, no. 1,
pp. 2-12, January 1994.
Refereed Publications in Conference Proceedings
-
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) (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.
- 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.
-
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.
-
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.
-
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.
-
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'21 2021), Prague, Czech Rebublic.
- Springer-Verlag Lecture Notes in Artificial Intelligence 12897,
pages 117-129, September 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.
-
A Closer Look at the Cake-Cutting Foundations through the Lens
of Measure Theory.
-
P. Kern, D. Neugebauer,
J. Rothe,
R. Schilling, D. Stoyan und R. Weishaupt.
- Nonarchival proceedings of the 8th International Workshop on
Computational Social Choice (COMSOC 2021), Technion, Haifa,
Israel, June 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 Stability.
- F. Frei, E. 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.
-
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.
-
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.
-
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.
-
Stability in Minimization-Based Altruistic Hedonic Games.
- A. Wiechers und
J. Rothe.
- Proceedings of the 9th European Starting AI
Researchers' Symposium (STAIRS 2020), Santiago de Compostela, Spain.
- CEUR-WS.org, vol. 2655, paper 3, August/September 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.
-
The Last Voting Rule Is Home: Complexity of Control by Partition of
Candidates or Voters in Maximin Elections.
- C. Maushagen 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 163-170, August/September 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.
- Towards
Reality: Smoothed Analysis in Computational Social Choice.
-
D. Baumeister, T. Hogrebe, and
J. Rothe.
- Proceedings of the 19th International
Conference on Autonomous Agents and Multiagent Systems (AAMAS
2020), Auckland, New Zealand.
- IFAAMAS, pages 1691-1695, May 2020.
- The
Complexity of Cloning Candidates in Multiwinner Elections.
-
M. Neveling and
J. Rothe.
- Proceedings of the 19th International
Conference on Autonomous Agents and Multiagent Systems (AAMAS
2020), Auckland, New Zealand.
- IFAAMAS, pages 922-930, May 2020.
-
Deciding Acceptance in Incomplete Argumentation Frameworks.
-
A. Niskanen, D. Neugebauer, M. Järvisalo, and
J. Rothe.
- Proceedings of the 34th AAAI Conference on
Artificial Intelligence (AAAI 2020), New York, NY, USA.
- AAAI Press, pages 2942-2949, February 2020.
- Refugee Allocation in the Setting of Hedonic Games.
-
B. Kuckuck,
J. Rothe, and
A. Weißenfeld.
- Proceedings of the 6th International Conference on Algorithmic
Decision Theory (ADT 2019), Duke University, Durham, NC, USA.
- Springer-Verlag Lecture Notes in Artificial Intelligence 11834,
pages 65-80, October 2019.
- Optimizing Social Welfare in Social Networks.
-
P. Lange and
J. Rothe.
- Proceedings of the 6th International Conference on Algorithmic
Decision Theory (ADT 2019), Duke University, Durham, NC, USA.
- Springer-Verlag Lecture Notes in Artificial Intelligence 11834,
pages 81-96, October 2019.
- The Complexity of Online Bribery in Sequential Elections.
-
E. Hemaspaandra,
L. Hemaspaandra,
and
J. Rothe.
- Proceedings of the 17th Conference on
Theoretical Aspects of Rationality and Knowledge (TARK 2019),
Toulouse, France. Electronic Proceedings in Theoretical Computer
Science 297, pages 233-251, July 2019.
- Stability in FEN-Hedonic Games for Single-Player Deviations.
-
A. Kerkmann and
J. Rothe.
- Proceedings of the 18th International Conference on Autonomous
Agents and Multiagent Systems (AAMAS 2019), Montréal, Canada.
- IFAAMAS, pages 891-899, May 2019.
-
Borda Count in Collective Decision Making: A Summary of Recent Results.
-
J. Rothe.
- Proceedings of the 33rd AAAI Conference on
Artificial Intelligence (AAAI 2019), Honolulu, Hawaii, USA.
- AAAI Press, pages 9830-9836, January/February 2019.
- Monotonicity, Duplication Monotonicity, and Pareto Optimality
in the Scoring-Based Allocation of Indivisible Goods.
-
B. Kuckuck and
J. Rothe.
- Proceedings of the 6th International Conference on Agreement
Technologies (AT 2018), Bergen, Norway.
- Springer-Verlag Lecture Notes in Artificial Intelligence
11327, pages 173-189, December 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.
- Sequential Allocation Rules are Separable: Refuting a
Conjecture on Scoring-Based Allocation of Indivisible Goods.
-
B. Kuckuck and
J. Rothe.
- Proceedings of the 17th International Conference on Autonomous
Agents and Multiagent Systems (AAMAS 2018), Stockholm, Sweden.
- IFAAMAS, pages 650-658, July 2018.
- 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.
- Complexity of Shift Bribery in Iterative Elections.
-
C. Maushagen,
M. Neveling,
J. Rothe, and
A. Selker.
- Proceedings of the 17th International Conference on Autonomous
Agents and Multiagent Systems (AAMAS 2018), Stockholm, Sweden.
- IFAAMAS, pages 1567-1575, July 2018.
- A
preliminary version
appeared in the nonarchival website proceedings of the 15th
International Symposium on Artificial Intelligence and Mathematics
(ISAIM 2018), Fort Lauderdale, FL, USA. January 2018.
-
Complexity of Verification in Incomplete Argumentation
Frameworks.
-
D. Baumeister, D. Neugebauer,
J. Rothe, and
H. Schadrack.
- Proceedings of the 32nd AAAI Conference on
Artificial Intelligence (AAAI 2018), New Orleans, LA, USA.
- AAAI Press, pages 1753-1760, February 2018.
- 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.
-
The Price to Pay for Forgoing Normalization in Fair Division of
Indivisible Goods.
-
P. Lange, N. Nguyen, and
J. Rothe.
- Nonarchival website proceedings of the 11th
Multidisciplinary Workshop on Advances in Preference Handling
(M-PREF 2018), New Orleans, LA, USA, February 2018.
- A
preliminary version
appeared in the nonarchival website proceedings of the 15th
International Symposium on Artificial Intelligence and Mathematics
(ISAIM 2018), Fort Lauderdale, FL, USA. January 2018.
-
Closing the Gap of Control Complexity in Borda Elections:
Solving Ten Open Cases.
- M. Neveling and
J. Rothe.
- Proceedings of the 18th Italian Conference on Theoretical
Computer Science (ICTCS 2017), Napoli, Italy.
- CEUR-WS.org, vol. 1949, pages 138-149, September 2017.
- Complexity of Control by Partition of Voters and of Voter
Groups in Veto and Other Scoring Protocols.
-
C. Maushagen and
J. Rothe.
- Proceedings of the 16th International Conference on Autonomous
Agents and Multiagent Systems (AAMAS 2017), São Paulo, Brazil.
- IFAAMAS, pages 615-623, May 2017.
- Approximate Solutions To Max-Min Fair and Proportionally
Fair Allocations of Indivisible Goods.
-
N. Nguyen, T. Nguyen and
J. Rothe.
- Proceedings of the 16th International
Conference on Autonomous Agents and Multiagent Systems (AAMAS
2017), São Paulo, Brazil.
- IFAAMAS, pages 262-271, 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.
-
Cost of Stability and Least Core in Path-Disruption Games.
-
V. Persien, A. Rey und
J. Rothe.
- Proceedings of the 8th European Starting AI
Researchers' Symposium (STAIRS 2016), The Hague, The Netherlands.
- IOS Press, pages 99-110, August/September 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.
-
Structural Control in Weighted Voting Games.
- A. Rey and
J. Rothe.
- Proceedings of the 41st International
Symposium on Mathematical Foundations of Computer Science
(MFCS 2016), Kraków, Poland.
- Schloss Dagstuhl-Leibniz-Zentrum für Informatik, LIPIcs, vol. 58,
pages 80:1-80:15, September 2016.
- An
extended abstract
appeared in the proceedings of the 15th International Conference
on Autonomous Agents and Multiagent Systems (AAMAS 2016),
Singapore, IFAAMAS, pages 1371-1372, May 2016.
- Also presented at the 7th International Workshop on Cooperative
Games in Multiagent Systems (CoopMAS 2016), co-located with AAMAS
2016, and at the 12th Conference on Logic and the Foundations of
Game and Decision Theory (LOFT 2016), Maastricht, The Netherlands,
July 2016, both with nonarchival proceedings.
-
Altruistic Hedonic Games.
-
N. Nguyen, A. Rey, L. Rey,
J. Rothe,
and L. Schend.
- Proceedings of the 15th International Conference on Autonomous
Agents and Multiagent Systems (AAMAS 2016), Singapore.
- IFAAMAS, pages 251-259, May 2016.
- Also presented at the 7th International Workshop on Cooperative
Games in Multiagent Systems (CoopMAS 2016), co-located with AAMAS
2016, and at the
6th International Workshop on Computational Social Choice
(COMSOC 2016), Toulouse, France, June 2016, both with nonarchival
proceedings.
-
Local Fairness in Hedonic Games via Individual Threshold
Coalitions.
-
N. Nguyen and
J. Rothe.
- Proceedings of the 15th International Conference on Autonomous
Agents and Multiagent Systems (AAMAS 2016), Singapore.
- IFAAMAS, pages 232-241, May 2016.
- Also presented at the 7th International Workshop on
Cooperative Games in Multiagent Systems (CoopMAS 2016), co-located
with AAMAS 2016, nonarchival proceedings.
- 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.
- 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.
- Fairness and Rank-Weighted Utilitarianism in Resource
Allocation.
-
T. Heinen, N. Nguyen, 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 521-536, September 2015.
-
Strategy-Proofness of Scoring Allocation Correspondences for
Indivisible Goods.
- N. Nguyen, D. Baumeister,
and
J. Rothe.
- Proceedings of the
24th International Joint Conference on Artificial
Intelligence (IJCAI 2015), Buenos Aires, Argentina.
- AAAI Press/IJCAI, pages 1127-1133, July 2015.
- Appears also in the nonarchival proceedings of the
6th International Workshop on Computational Social Choice
(COMSOC 2016), Toulouse, France, June 2016.
- Representing and Solving Hedonic Games with Ordinal Preferences
and Thresholds.
-
J. Lang, A. Rey,
J. Rothe,
H. Schadrack, and L. Schend.
- Proceedings of the 14th International
Conference on Autonomous Agents and Multiagent Systems
(AAMAS 2015), Istanbul, Turkey.
- IFAAMAS, pages 1229-1237, May 2015.
- The Margin of Victory in Schulze, Cup, and Copeland
Elections: Complexity of the Regular and Exact Variants.
-
Y. Reisch,
J. Rothe, and
L. Schend.
- Proceedings of the 7th European Starting AI Researchers'
Symposium (STAIRS 2014), Prague, Czech Republic. IOS Press, pages
250-259, August 2014.
- Scoring Rules for the Allocation of Indivisible Goods.
-
D. Baumeister, S. Bouveret, J. Lang, N. Nguyen, T. Nguyen, and
J. Rothe.
- Proceedings of the 21st European Conference on Artificial
Intelligence (ECAI 2014), Prague, Czech Republic. IOS Press,
pages 75-80, August 2014. (An extended version, jointly with
A. Saffidine, appears in the nonarchival proceedings of the 5th
International Workshop on Computational Social Choice (COMSOC
2014), A. Procaccia and T. Walsh, editors. Carnegie Mellon
University, Pittsburgh, PA, USA, June 2014.)
-
Toward the Complexity of the Existence of Wonderfully Stable
Partitions and Strictly Core Stable Coalition Structures in Hedonic
Games.
-
A. Rey,
J. Rothe,
H. Schadrack, and L. Schend.
- Proceedings of the 11th Conference on Logic and the Foundations
of Game and Decision Theory (LOFT 2014), nonarchival proceedings.
Bergen, Norway, July 2014.
- Also invited for the nonarchival website proceedings of
the Special Session on Computational Social Choice at the 13th
International Symposium on Artificial Intelligence and Mathematics
(ISAIM 2014), Fort Lauderdale, FL, USA. January 2014.
- Bribery in Multiple-Adversary Path-Disruption Games is Hard for
the Second Level of the Polynomial Hierarchy (Extended
Abstract).
-
A. Marple, A. Rey, and
J. Rothe.
- Proceedings of the 13th International
Conference on Autonomous Agents and Multiagent Systems
(AAMAS 2014), Paris, France.
- IFAAMAS, pages 1375-1376, May 2014.
- Complexity of Manipulation, Bribery, and Campaign Management in
Bucklin and Fallback Voting (Extended Abstract).
-
P. Faliszewski, Y. Reisch,
J. Rothe, and
L. Schend.
- Proceedings of the 13th International Conference on Autonomous
Agents and Multiagent Systems (AAMAS 2014), Paris, France.
- IFAAMAS, pages 1357-1358, May 2014.
-
False-Name Manipulation in Weighted Voting Games is Hard for
Probabilistic Polynomial Time.
-
A. Rey and
J. Rothe.
- Proceedings of the 11th Latin American
Theoretical Informatics Symposium (LATIN 2014), Montevideo,
Uruguay.
- Springer-Verlag Lecture Notes in Computer Science 8392,
pages 60-71, March/April 2014.
- Also presented at the 5th International Workshop on Cooperative
Games in Multiagent Systems (CoopMAS 2014), co-located with AAMAS
2014, nonarchival proceedings, Paris, France.
- Positional Scoring Rules for the Allocation of Indivisible
Goods.
- D. Baumeister, S. Bouveret, J. Lang, T. Nguyen,
J. Rothe, and A. Saffidine.
- Proceedings of the 11th European Workshop on
Multi-Agent Systems (EUMAS 2013), Toulouse, France. December
2013.
- How to Decrease the Degree of Envy in Allocations of
Indivisible Goods.
-
T. Nguyen
and
J. Rothe.
- Proceedings of the 3rd International Conference on Algorithmic
Decision Theory (ADT 2013), Brussels, Belgium.
- Springer-Verlag Lecture Notes in Artificial Intelligence 8176,
pages 271-284, November 2013.
- Computational Aspects of Manipulation and Control in Judgment
Aggregation.
-
D. Baumeister, G. Erdélyi, O. Erdélyi,
and
J. Rothe.
- Proceedings of the 3rd International Conference on Algorithmic
Decision Theory (ADT 2013), Brussels, Belgium.
- Springer-Verlag Lecture Notes in Artificial Intelligence 8176,
pages 71-85, November 2013.
- An extended version appears in the nonarchival proceedings of
the 5th International Workshop on Computational Social Choice
(COMSOC 2014), A. Procaccia and T. Walsh, editors. Carnegie Mellon
University, Pittsburgh, PA, USA, June 2014.
- A preliminary version appeared in the nonarchival proceedings of
the ESSLLI Workshop on Logical Models of Group Decision Making
(ESSLLI-LMGD 2013), Düsseldorf, Germany, August 2013.
- Envy-Ratio and Average-Nash Social Welfare Optimization in
Multiagent Resource Allocation (Extended Abstract).
-
T. Nguyen and
J. Rothe.
- Proceedings of the 12th International Conference on Autonomous
Agents and Multiagent Systems (AAMAS 2013), St. Paul, MN, USA.
- IFAAMAS, pages 1139-1140, May 2013.
- An extended version was presented at the 6th International
Workshop on Optimisation in Multi-Agent Systems (OPTMAS 2013),
co-located with AAMAS 2013, nonarchival proceedings, pages 1-18.
-
The Complexity of Online Manipulation of Sequential Elections.
-
E. Hemaspaandra,
L. Hemaspaandra,
and
J. Rothe.
- Proceedings of the 14th Conference on Theoretical Aspects of
Rationality and Knowledge (TARK 2013), Chennai, India. Available
at arXiv:1310.6997 [cs.GT], ACM Computing Research Repository (CoRR),
pages 111-120, January 2013.
- A preliminary version appears in the nonarchival proceedings of
the 4th International Workshop on Computational Social Choice
(COMSOC 2012), F. Brandt and P. Faliszewski, editors, pages 227-238.
AGH University of Science and Technology, Kraków, Poland, September
2012.
-
A Statistical Approach to Calibrating the Scores of Biased
Reviewers: The Linear vs. the Nonlinear Model.
-
M. Roos,
J. Rothe,
J. Rudolph,
D. Stoyan,
and
B. Scheuermann.
- Nonarchival website proceedings of the 6th Multidisciplinary
Workshop on Advances in Preference Handling (M-PREF 2012),
Montpellier, France, August 2012.
- Control in Judgment Aggregation.
-
D. Baumeister, G. Erdélyi, O. Erdélyi,
and
J. Rothe.
- Proceedings of the 6th European Starting AI
Researchers' Symposium (STAIRS 2012), Montpellier, France. IOS
Press, pages 23-34, August 2012.
- A version combining this STAIRS 2012 paper with an ADT 2011 paper
appears as "Bribery and Control in Judgment Aggregation" in
the nonarchival proceedings of the