Jump to contentJump to search

Publications

To Appear

Complexity of Sequential Rules in Judgment Aggregation. D. Baumeister, L. Boes, and R. Weishaupt. To appear in "Proceedings of the 20th Conference on Autonomous Agents and Multiagent Systems." 2021.

Complexity of Scheduling and Predicting Round-Robin Tournaments. D. Baumeister and T. Hogrebe. To appear in "Proceedings of the 20th Conference on Autonomous Agents and Multiagent Systems." 2021.

2020

Towards Reality: Smoothed Analysis in Computational Social Choice. D. Baumeister, T. Hogrebe, and J. Rothe. In "Proceedings of the 19th Conference on Autonomous Agents and Multiagent Systems." (Blue Sky Idea Track) 2020, pages 1691-1695.

Manipulation of Opinion Polls to Influence Iterative Elections. D. Baumeister, A. Selker, and A. Wilczynski. In "Proceedings of the 19th Conference on Autonomous Agents and Multiagent Systems." 2020, pages 132-140.

Irresolute Approval-Based Budgeting (Extended Abstract). D. Baumeister, L. Boes, and T. Seeger. In "Proceedings of the 19th Conference on Autonomous Agents and Multiagent Systems". 2020, pages 1774-1776.

Complexity of Election Evaluation and Probabilistic Robustness (Extended Abstract). D. Baumeister and T. Hogrebe. In "Proceedings of the 19th Conference on Autonomous Agents and Multiagent Systems". 2020, pages 1771-1773.

2019

How Hard Is the Manipulative Design of Scoring Systems? D. Baumeister and T. Hogrebe. In "Proceedings of the 28th International Joint Conference on Artificial Intelligence". 2019, pages 74-80.

Manipulative Design of Scoring Systems (Extended Abstract). D. Baumeister and T. Hogrebe. In: "Proceedings of the 18th Conference on Autonomous Agents and Multiagent Systems". 2019, pages 1814-1816.

Generalized Distance Bribery. D. Baumeister, T. Hogrebe, and L. Rey. In: "Proceedings of the 33rd AAAI Conference on Artificial Intelligence". 2019, pages 1764-1771. A preliminary version appears in the proceedings of the 7th International Workshop on Computational Social Choice (COMSOC 2018), Troy, NY, USA, 2018.

2018

Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks. D. Baumeister, D. Neugebauer, and J. Rothe. In: “Proceedings of the 7th International Conference on Computational Models of Argument”. IOS Press, 2018, pages 181–192.

Argumentation Meets Computational Social Choice: A Tutorial. D. Baumeister, D. Neugebauer, and J. Rothe. Tutorial at the “27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence”, 2018.

Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods. N. Nguyen, D. Baumeister, and J. Rothe. In: Social Choice and Welfare, 50(1): (2018), pages 101–122.

Verification in Incomplete Argumentation Frameworks. D. Baumeister, D. Neugebauer, J. Rothe, and H. Schadrack.  In: Artificial Intelligence, 264: (2018), pages 1–26.

Complexity of Verification in Incomplete Argumentation Frameworks. D. Baumeister, D. Neugebauer, J. Rothe, and H. Schadrack. In: “Proceedings of the 32nd AAAI Conference on Artificial Intelligence” 2018, pages 1753–1760. Appears also in the proceedings of the 7th International Workshop on Computational Social Choice (COMSOC 2018), Troy, NY, USA, 2018.

Complexity of Verification in Abstract Argumentation Frameworks. D. Baumeister. SIGACT News Complexity Theory Guest Column 48(4): 2017, pages 43–56.

2017

Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261). D. Baumeister, P. Faliszewski, A. Laruelle, and T. Walsh.  In: Dagstuhl Reports, 7(6): (2017), pages 109–134.

Positional Scoring-Based Allocation of Indivisible Goods. D. Baumeister, S. Bouveret, J. Lang, N. Nguyen, T. Nguyen, and J. Rothe. In: Journal of Autonomous Agents and Multi-Agent Systems, 31(3): (2017), pages 628-655.

Strategic Behavior in Judgment Aggregation. D. Baumeister, J. Rothe, and A. Selker. In: “Trends in Computational Social Choice”. Edited by U. Endriss. AI Access Foundation, 2017, pages 145-168.

2016

Minisum and Minimax Committee Election Rules for General Preference Types. D. Baumeister, T. Böhnlein, L. Rey, O. Schaudt, and A. Selker. In: “Proceedings of 22nd European Conference on Artificial Intelligence”. Short paper. IOS Press, pages 1656–1657, 2016,

2015

Preference Aggregation by Voting. D. Baumeister and J. Rothe. In: “Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division”. Edited by J. Rothe. Springer-Verlag, pages 197–326, 2015.

Judgment Aggregation. In: “Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division”. D. Baumeister, G. Erdélyi, and J. Rothe. Edited by J. Rothe. Springer-Verlag, pages 361–393, 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.

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.

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

2014

Scoring Rules for the Allocation of Indivisible Goods. D. Baumeister, S. Bouveret, J. Lang, N. Nguyen, T. Nguyen, J. Rothe, and A. Saffidine. In the proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014), Prague, Czech Republic. IOS Press, pages 75-80, August 2014.
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.

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.

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

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.

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 in Judgment Aggregation. D. Baumeister, G. Erdélyi, O. 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.

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.

Computational Complexity of Two Variants of the Possible Winner Problem. D. Baumeister, M. Roos, and J. Rothe. Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taipei, Taiwan. IFAAMAS, pages 853-860, May 2011.

How Hard is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. D. Baumeister, G. Erdélyi, and J. Rothe. Proceedings of the 2nd International Conference on Algorithmic Decision Theory (ADT 2011), DIMACS Center, Rutgers University, USA. Springer-Verlag Lecture Notes in Artificial Intelligence 6992, pages 1-15, October 2011.

2010

Computational Aspects of Approval Voting. D. Baumeister, G. Erdélyi, L. Hemaspaandra, E. Hemaspaandra, and J. Rothe. Chapter 10 in "Handbook on Approval Voting," pp. 199-251, J. Laslier and R. Sanver, editors. Springer-Verlag, Berlin, Heidelberg, 2010.

The Complexity of Computing Minimal Unidirectional Covering Sets. D. Baumeister, F. Brandt, F. Fischer, J. Hoffmann, and J. Rothe. Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC 2010), Rome, Italy. Springer-Verlag Lecture Notes in Computer Science 6078, pages 299-310, May 2010.

Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. D. Baumeister and J. Rothe. Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), Lisbon, Portugal. IOS Press, pages 1019-1020 (short paper), August 2010.

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

2008

The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions. D. Baumeister and J. Rothe. Proceedings of the 2nd International Conference on Language and Automata Theory and Applications (LATA 2008), Tarragona, Spain. Springer-Verlag Lecture Notes in Computer Science 5196, pages 76-87, March 2008.
Preproceedings, pages 89-100, Technical Report, Rovira i Virgili University, Tarragona, Spain, 2008.

2007

Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem. D. Baumeister and J. Rothe. Proceedings of the 5th Conference on Machines, Computations and Universality (MCU 2007), Orléans, France. Springer-Verlag Lecture Notes in Computer Science 4664, pages 134-145, September 2007.

Complexity of the Tantrix(TM) Rotation Puzzle Problem. D. Baumeister. Master Thesis. Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany, 54 pages, September 2007.

 

Responsible for the content: