D. Baumeister and J. Rothe (editors). Proceedings of the 19th European Conference on Multi-Agent Systems, EUMAS 2022, Düsseldorf, Germany, September 14-16, 2022, Lecture Notes in Computer Science 13442, Springer 2022.
D. Baumeister. Future of Decision-Making. In: “Future of Economic Design”. Edited by J. Laslier, H. Moulin, R. Sanver, and W. Zwicker. 2019, pages 15–20.
D. Baumeister, J. Rothe, and A. Selker. Strategic Behavior in Judgment Aggregation. In: “Trends in Computational Social Choice”. Edited by U. Endriss. AI Access Foundation, 2017, pages 145–168.
D. Baumeister, G. Erdélyi, and J. Rothe. Judgment Aggregation. In: “Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division”. Edited by J. Rothe. Springer-Verlag, 2015, pages 361–393.
D. Baumeister and J. Rothe. Preference Aggregation by Voting. In: “Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division”. Edited by J. Rothe. Springer-Verlag, 2015, pages 197–326.
J. Rothe, D. Baumeister, C. Lindner, and I. Rothe. Einführung in Computational Social Choice: Individuelle Strategien und kollektive Entscheidungen beim Spielen, Wählen und Teilen. Spektrum Akademischer Verlag, 2011.
D. Baumeister, G. Erdélyi, E. Hemaspaandra, L. Hemaspaandra, and J. Rothe. Computational Aspects of Approval Voting. In: “Handbook of Approval Voting”. Edited by J. Laslier and R. Sanver. Springer, 2010, pages 199–251.
D. Baumeister, D. Neugebauer, and J. Rothe. Collective Acceptability in Abstract Argumentation. In: Journal of Applied Logics, 8(6): (2021). Appears also as a chapter in Handbook of Formal Argumentation, Volume 2, edited bei D. Gabbay, M. Giacomin, G. Simari, and M. Thimm., pages 1503–1542.
D. Baumeister, M. Järvisalo, D. Neugebauer, A. Niskanen, and J. Rothe. Acceptance in Incomplete Argumentation Frameworks. In: Artificial Intelligence, 295: (2021), page 103470.
D. Baumeister, O. Erdélyi, G. Erdélyi, J. Rothe, and A. Selker. Complexity of Control in Judgment Aggregation for Uniform Premise-Based Quota Rules. In: Journal of Computer and System Sciences, 112: (2020), pages 13–33.
D. Baumeister, D. Neugebauer, J. Rothe, and H. Schadrack. Verification in Incomplete Argumentation Frameworks. In: Artificial Intelligence, 264: (2018), pages 1–26.
N. Nguyen, D. Baumeister, and J. Rothe. Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods. In: Social Choice and Welfare, 50(1): (2018), pages 101–122.
D. Baumeister, S. Bouveret, J. Lang, N. Nguyen, T. Nguyen, J. Rothe, and A. Saffidine. Positional Scoring-Based Allocation of Indivisible Goods. In: Journal of Autonomous Agents and Multi-Agent Systems, 31(3): (2017), pages 628–655.
D. Baumeister, G. Erdélyi, O. Erdélyi, and J. Rothe. Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules. In: Mathematical Social Sciences, 76: (2015), pages 19–30.
D. Baumeister, F. Brandt, F. Fischer, J. Hoffmann, and J. Rothe. The Complexity of Computing Minimal Unidirectional Covering Sets. In: Theory of Computing Systems, 53(3): (2013), pages 467–502.
D. Baumeister and J. Rothe. Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. In: Information Processing Letters, 112(5): (2012), pages 186–190.
D. Baumeister and J. Rothe. The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions. In: Information and Computation, 207(11): (2009), pages 1119–1139.
D. Baumeister and J. Rothe. Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem. In: Fundamenta Informaticae, 91(1): (2009), pages 35–51.
D. Baumeister, L. Boes, and C. Laußmann. Time-Constrained Participatory Budgeting Under Uncertain Project Costs. In: “Proceedings of the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence”. ijcai.org, 2022, pages 74–80.
D. Baumeister and T. Hogrebe. On the Average-Case Complexity of Predicting Round-Robin Tournaments (Extended Abstract). In: “Proceedings of the 21st International Joint Conference on Autonomous Agents and Multiagent Systems.” IFAAMAS, 2022, pages 1542–1544.
D. Baumeister, L. Boes, and J. Hillebrand. Complexity of Manipulative Interference in Participatory Budgeting. In: “Proceedings of the 7th International Conference on Algorithmic Decision Theory”. to appear. Springer-Verlag LNCS, 2021, pages 424–439.
D. Baumeister and T. Hogrebe. On the Complexity of Predicting Election Outcomes and Estimating Their Robustness. In: “Proceedings of the 18th European Conference on Multiagent Systems”. Springer-Verlag LNCS #12802, 2021, pages 228–244.
D. Baumeister, L. Boes, and R. Weishaupt. Complexity of Sequential Rules in Judgment Aggregation. In: “Proceedings of the 20th International Joint Conference on Autonomous Agents and Multiagent Systems.” to appear. IFAAMAS, 2021. Appears also in the proceedings of the 8th International Workshop on Computational Social Choice (COMSOC 2021), Haifa, Isreal.
D. Baumeister and T. Hogrebe. Complexity of Scheduling and Predicting Round-Robin Tournaments. In: “Proceedings of the 20th International Joint Conference on Autonomous Agents and Multiagent Systems.” to appear. IFAAMAS, 2021. Appears also in the proceedings of the 8th International Workshop on Computational Social Choice (COMSOC 2021), Haifa, Isreal.
D. Baumeister, A. Selker, and A. Wilczynski. Manipulation of Opinion Polls to Influence Iterative Elections. In: “Proceedings of the 19th International Joint Conference on Autonomous Agents and Multiagent Systems.” IFAAMAS, 2020, pages 132–140. Appears also in the proceedings of the 8th International Workshop on Computational Social Choice (COMSOC 2021), Haifa, Isreal.
D. Baumeister and T. Hogrebe. Complexity of Election Evaluation and Probabilistic Robustness (Extended Abstract). In: “Proceedings of the 19th International Joint Conference on Autonomous Agents and Multiagent Systems.” IFAAMAS, 2020, pages 1771–1773.
D. Baumeister, L. Boes, and T. Seeger. Irresolute Approval-Based Budgeting (Extended Abstract). In: “Proceedings of the 19th International Joint Conference on Autonomous Agents and Multiagent Systems.” IFAAMAS, 2020, pages 1774–1776.
D. Baumeister, T. Hogrebe, and J. Rothe. Towards Reality: Smoothed Analysis in Computational Social Choice. In: “Proceedings of the 19th International Joint Conference on Autonomous Agents and Multiagent Systems.” Blue Sky Idea Track. IFAAMAS, 2020, pages 1691–1695.
D. Baumeister and T. Hogrebe. How Hard Is the Manipulative Design of Scoring Systems. In: “Proceedings of the 28th International Joint Conference on Artificial Intelligence”. ijcai.org, 2019, pages 74–80.
D. Baumeister and T. Hogrebe. Manipulative Design of Scoring Systems (Extended Abstract). In: “Proceedings of the 18th International Joint Conference on Autonomous Agents and Multiagent Systems.” IFAAMAS, 2019, pages 1814–1816.
D. Baumeister, T. Hogrebe, and L. Rey. Generalized Distance Bribery. In: “Proceedings of the 33rd AAAI Conference on Artificial Intelligence”. AAAI Press, 2019, pages 1764–1171. A preliminary version appears in the proceedings of the 7th International Workshop on Computational Social choice (COMSOC 2018), Troy, NY, USA, 2018.
D. Baumeister, D. Neugebauer, and J. Rothe. Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks. In: “Proceedings of the 7th International Conference on Computational Models of Argument”. IOS Press, 2018, pages 181–192.
D. Baumeister, D. Neugebauer, J. Rothe, and H. Schadrack. Complexity of Verification in Incomplete Argumentation Frameworks. In: “Proceedings of the 32nd AAAI Conference on Artificial Intelligence”. AAAI Press, 2018, pages 1753–1760. Appears also in the proceedings of the 7th International Workshop on Computational Social Choice (COMSOC 2018), Troy, NY, USA, 2018.
D. Baumeister, T. Böhnlein, L. Rey, O. Schaudt, and A. Selker. Minisum and Minimax Committee Election Rules for General Preference Types. In: “Proceedings of the 22nd European Conference on Artificial Intelligence”. Short paper. IOS Press, 2016, pages 1656–1657.
D. Baumeister, S. Dennisen, and L. Rey. Winner Determination and Manipulation in Minisum and Minimax Committee Elections. In: “Proceedings of the 4th International Conference on Algorithmic Decision Theory”. Springer-Verlag Lecture Notes in Computer Science #9346, 2015, pages 469–485.
D. Baumeister, D. Neugebauer, and J. Rothe. Verification in Attack-Incomplete Argumentation Frameworks. In: “Proceedings of the 4th International Conference on Algorithmic Decision Theory”. Springer-Verlag Lecture Notes in Computer Science #9346, 2015, pages 341–358. Appears also in the proceedings of the 6th International Workshop on Computational Social Choice (COMSOC 2016), Toulouse, France, 2016.
D. Baumeister, J. Rothe, and A. Selker. Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types. In: “Proceedings of the 4th International Conference on Algorithmic Decision Theory”. Springer-Verlag Lecture Notes in Computer Science #9346, 2015, pages 432–448.
D. Baumeister, J. Rothe, and H. Schadrack. Verification in Argument-Incomplete Argumentation Frameworks. In: “Proceedings of the 4th International Conference on Algorithmic Decision Theory”. Springer-Verlag Lecture Notes in Computer Science #9346, 2015, pages 359–376. Appears also in the proceedings of the 6th International Workshop on Computational Social Choice (COMSOC 2016), Toulouse, France, 2016.
N. Nguyen, D. Baumeister, and J. Rothe. Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods. In: “Proceedings of the 24th International Joint Conference on Artificial Intelligence”. AAAI Press/IJCAI, 2015, pages 1127–1133. Appears also in the proceedings of the 6th International Workshop on Computational Social Choice (COMSOC 2016), Toulouse, France, 2016.
D. Baumeister and S. Dennisen. Voter Dissatisfaction in Committee Elections (Extended Abstract). In: “Proceedings of the 14th International Joint Conference on Autonomous Agents and Multiagent Systems”. IFAAMAS, 2015, pages 1707–1708.
D. Baumeister, S. Bouveret, J. Lang, T. Nguyen, N. Nguyen, and J. Rothe. Scoring Rules for the Allocation of Indivisible Goods. In: “Proceedings of the 21st European Conference on Artificial Intelligence”. IOS Press, 2014, pages 75–80. An extended version, jointly with A. Saffidine, appears in the proceedings of the 5th International Workshop on Computational Social Choice (COMSOC 2014), Pittsburgh, USA, 2014.
D. Baumeister, G. Erdélyi, O. Erdélyi, and J. Rothe. Computational Aspects of Manipulation and Control in Judgment Aggregation. In: “Proceedings of the 3rd International Conference on Algorithmic Decision Theory”. Springer-Verlag Lecture Notes in Artificial Intelligence #8176, Nov. 2013, pages 71–85. A preliminary version appeared in the proceedings of the ESSLLI Workshop on Logical Models of Group Decision Making, nonarchival proceedings, Düsseldorf, Germany, 2013.
D. Baumeister, G. Erdélyi, O. Erdélyi, and J. Rothe. Control in Judgment Aggregation. In: “Proceedings of the 6th European Starting AI Researcher Symposium”. IOS Press, 2012, pages 23–34. A version combining this STAIRS 2012 paper with an ADT 2011 paper appeared as “Bribery and Control in Judgment Aggregation” in the proceedings of the 4th International Workshop on Computational Social Choice (COMSOC 2012), Krakow, Poland, 2012.
D. Baumeister, M. Roos, J. Rothe, L. Schend, and L. Xia. The Possible Winner Problem with Uncertain Weights. In: “Proceedings of the 20th European Conference on Artificial Intelligence”. IOS Press, 2012, pages 133–138. An extended version appeared in the proceedings of the 4th International Workshop on Computational Social Choice (COMSOC 2012), Krakow, Poland, 2012.
D. Baumeister, P. Faliszewski, J. Lang, and J. Rothe. Campaigns for Lazy Voters: Truncated Ballots. In: “Proceedings of the 11th International Joint Conference on Autonomous Agents and Multiagent Systems”. IFAAMAS, 2012, pages 577–584.
D. Baumeister, G. Erdélyi, and J. Rothe. How Hard is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. In: “Proceedings of the 2nd International Conference on Algorithmic Decision Theory”. Springer-Verlag Lecture Notes in Artificial Intelligence #6992, 2011, pages 1–15.
D. Baumeister, M. Roos, and J. Rothe. Computational Complexity of Two Variants of the Possible Winner Problem. In: “Proceedings of the 10th International Joint Conference on Autonomous Agents and Multiagent Systems”. IFAAMAS, 2011, pages 853–860.
D. Baumeister and J. Rothe. Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. In: “Proceedings of the 19th European Conference on Artificial Intelligence”. Short paper. IOS Press, 2010, pages 1019–1020.
D. Baumeister, F. Brandt, F. Fischer, J. Hoffmann, and J. Rothe. The Complexity of Computing Minimal Unidirectional Covering Sets. In: “Proceedings of the 7th International Conference on Algorithms and Complexity”. Springer-Verlag Lecture Notes in Computer Science #6078, 2010, pages 299–310.
D. Baumeister and J. Rothe. The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions. In: “Proceedings of the 2nd International Conference on Language and Automata Theory and Applications”. Springer-Verlag Lecture Notes in Computer Science #5196, 2008, pages 76–87.
D. Baumeister and J. Rothe. Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem. In: “Proceedings of the 5th Conference on Machines, Computations and Universality”. Springer-Verlag Lecture Notes in Computer Science #4664, 2007, pages 134–145.
D. Baumeister, D. Neugebauer, and J. Rothe. Argumentation Meets Computational Social Choice: A Tutorial. Tutorial at the “27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence”, 2018.
D. Baumeister. Guest Column: Complexity of Verification in Abstract Argumentation Frameworks. In: SIGACT News, 48(4): (2017), pages 43–56.
D. Baumeister, P. Faliszewski, A. Laruelle, and T. Walsh. Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261). In: Dagstuhl Reports, 7(6): (2017), pages 109–134.
D. Baumeister. Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation. PhD thesis. Germany: Heinrich-Heine-Universität Düsseldorf, Institut für Informatik, 2012.