Publications

Sort by  |  Author

Refereed Journal Publications

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.

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.

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.

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

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.

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.

Refereed Publications in Conference Proceedings

Altruistic Hedonic Games.
N. Nguyen, L. Rey, A. 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.

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

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.

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.

The Complexity of Voter Partition in Bucklin and Fallback Voting: Solving Three Open Problems.
G. Erdélyi, L. Piras, and J. Rothe.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taipei, Taiwan. IFAAMAS, pages 837-844, May 2011.

Invited Contribution to Journals, Conferences, Workshops, etc.

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, FL, USA. January 2012.

Technical Reports

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.

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.

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.

Bucklin Voting is Broadly Resistant to Control.
G. Erdélyi, L. Piras, and J. Rothe.
Technical Report arXiv:1005.4115v1 [cs.GT], ACM Computing Research Repository (CoRR), 20 pages, May 2010.

Control Complexity in Fallback Voting.
G. Erdélyi, L. Piras, and J. Rothe.
Technical Report arXiv:1004.3398v1 [cs.GT], ACM Computing Research Repository (CoRR), 30 pages, April 2010.

PhD Thesis

From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games.
L. Schend.
PhD Thesis. Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany, 211 pages, January 2016.

Master Thesis

Control Complexity in Bucklin and Fallback Voting.
L. Piras.
Master Thesis. Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany, 69 pages, January 2011.
Awarded the Ferchau Prize 2011 for the best Master thesis in Computer Science at HHU Düsseldorf.