## Publications

### To Appear

Positional Scoring-Based Allocation of Indivisible Goods.

D. Baumeister, S. Bouveret, J. Lang, N. Nguyen, T. Nguyen, J. Rothe, and A. Saffidine.

To appear in Journal of Autonomous Agents and Multi-Agent Systems.

### 2016

Control and Bribery in Voting.

P. Faliszewski and J. Rothe.

Chapter 7 in Handbook of Computational
Social Choice, F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. Procaccia (editors),
pp. 146-168. Cambridge University Press, 2016.

Password to open the pdf: cam1CSC

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.

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.

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, 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, O. Erdélyi, G. Erdélyi, and J. Rothe.

Mathematical Social Sciences, vol. 76, pp. 19-30, July 2015.

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.

Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods.

N. Nguyen, D. Baumeister, 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.

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, USA. Springer-Verlag Lecture Notes in Artificial Intelligence 9346, pages 432-448, 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.

E. Hemaspaandra, L. Hemaspaandra, and J. Rothe.

Journal of Computer and System Sciences, vol. 80, no. 4, pp. 697-710, June 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.

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 proceedings of the 5th International Workshop on Computational Social Choice (COMSOC 2014), A. Procaccia and T. Walsh, editors.
Carnegie Mellon University, Pittsburgh, USA, June 2014.

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 Researcher Symposium (STAIRS 2014), Prague, Czech Republic. IOS Press, pages 250-259, August 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 website proceedings of the Special Session
on Computational Social Choice at the 13th International Symposium on
Artificial Intelligence and Mathematics (ISAIM 2014), Fort Lauderdale, USA. January 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 Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2014), Paris, France. IFAAMAS, pages 1357-1358, May 2014.

### 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.

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.

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 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.

Computational Aspects of Manipulation and Control in Judgment Aggregation.

D. Baumeister, O. Erdélyi, G. 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 proceedings of the 5th International Workshop on Computational Social Choice (COMSOC 2014), A. Procaccia and T. Walsh, editors. Carnegie Mellon University, Pittsburgh, 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.

Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting.

P. Faliszewski, Y. Reisch, J. Rothe, and L. Schend.

Technical Report arXiv:1307.7322v1 [cs.GT], ACM Computing Research Repository (CoRR), 28 pages, July 2013.

### 2012

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.

Campaigns for Lazy Voters: Truncated Ballots.

D. Baumeister, P. Faliszewski, J. Lang, and J. Rothe.

Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2012), Valencia, Spain. IFAAMAS, pages 577-584, June 2012.

Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach.

J. Rothe and L. Schend.

Proceedings of the 11th International Symposium on Experimental Algorithms (SEA 2012), Bordeaux, France. Springer-Verlag Lecture Notes in Computer Science 7276, pages 356-368, June 2012.

Controlling Candidate-Sequential Elections.

E. Hemaspaandra, L. Hemaspaandra, and J. Rothe.

Proceedings of the 20th European Conference on
Artificial Intelligence (ECAI 2012), Montpellier, France. IOS
Press, pages 905-906, August 2012.

The Possible Winner Problem with Uncertain Weights.

D. Baumeister, M. Roos, J. Rothe, L. Schend, and L. Xia.

Proceedings of the 20th European Conference on
Artificial Intelligence (ECAI 2012), Montpellier, France. IOS
Press, pages 133-138, August 2012.

An extended version appears in the proceedings of the 4th International Workshop on Computational Social Choice (COMSOC 2012), F. Brandt and P. Faliszewski, editors, pages 49-60. AGH University of Science and Technology, Kraków, Poland, September 2012.

Online Voter Control in Sequential Elections.

E. Hemaspaandra, L. Hemaspaandra, and J. Rothe.

Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), Montpellier, France. IOS Press, pages 396-401, August 2012.

Control in Judgment Aggregation.

D. Baumeister, O. Erdélyi, G. Erdélyi, and J. Rothe.

Proceedings of the 6th European Starting AI Researcher 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 proceedings of the 4th International Workshop on Computational Social Choice (COMSOC 2012), F. Brandt and P. Faliszewski, editors, pages 37-48. AGH University of Science and Technology, Kraków, Poland, September 2012.

A Dynamic Model of Preference Aggregation.

H. Schadrack.

Proceedings of the 10th Conference on Logic and the Foundations of Game and Decision Theory (LOFT 2012), Sevilla, Spain. Short paper, June 2012.

A Statistical Approach to Calibrating the Scores of Biased Reviewers: The Linear vs. the Nonlinear Model.

M. Roos, J. Rothe, J. Rudolph, B. Scheuermann, and D. Stoyan.

Website proceedings of the 6th Multidisciplinary Workshop on Advances in Preference Handling (M-PREF 2012), Montpellier, France, August 2012.

Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey.

J. Rothe and L. Schend.

Website proceedings of the Special Session on Computational Social Choice at the 12th International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, USA. January 2012.

Controlling Candidate-Sequential Elections.

E. Hemaspaandra, L. Hemaspaandra, and J. Rothe.

Technical Report arXiv:1202.6649v1 [cs.GT], ACM Computing Research Repository (CoRR), 6 pages, February 2012.

Also appears as University of Rochester Computer Science Department Technical Report URCS-TR-2012-975, Rochester, NY, 6 pages, February 2012.

The Complexity of Online Manipulation of Sequential Elections.

E. Hemaspaandra, L. Hemaspaandra, and J. Rothe.

Technical Report arXiv:1202.6655v4 [cs.GT], ACM Computing Research Repository (CoRR), 24 pages, February 2012. Revised, May, July, and September 2012.

Also appears as University of Rochester Computer Science Department Technical Report URCS-TR-2012-974, Rochester, NY, 24 pages, February 2012. Revised, May, July, and September 2012.

Online Voter Control in Sequential Elections.

E. Hemaspaandra, L. Hemaspaandra, and J. Rothe.

Technical Report arXiv:1203.0411v1 [cs.GT], ACM Computing Research Repository (CoRR), 14 pages, March 2012.

Also appears as University of Rochester Computer Science Department Technical Report URCS-TR-2012-976, Rochester, NY, 14 pages, March 2012.

Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach.

J. Rothe and L. Schend.

Technical Report arXiv:1203.3967v2 [cs.GT], ACM Computing Research Repository (CoRR), 370 pages, March 2012. Revised, August 2012.

Control Complexity in Bucklin and Fallback Voting.

G. Erdélyi, M. Fellows, J. Rothe, and L. Schend.

Technical Report arXiv:1103.2230v2 [cs.CC], ACM Computing Research Repository (CoRR), 50 pages, March 2011. Revised, August 2012.

Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation

D. Baumeister.

PhD Thesis. Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany, 130 pages, September 2012.

### 2011

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.

Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules.

D. Baumeister and J. Rothe.

Technical Report arXiv:1108.4436v2 [cs.CC], ACM Computing Research Repository (CoRR), 9 pages, August 2011. Revised, November 2011.