Dorothea Baumeister

According to our database, Dorothea Baumeister authored at least 53 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

The possible winner with uncertain weights problem.

Dorothea Baumeister, Marc Neveling, Magnus Roos, Jörg Rothe, Lena Schend, Robin Weishaupt, Lirong Xia

J. Comput. Syst. Sci., December, 2023

On the Complexity of Predicting Election Outcomes and Estimating Their Robustness.

Dorothea Baumeister, Tobias Hogrebe

SN Comput. Sci., July, 2023

Bounded Approval Ballots: Balancing Expressiveness and Simplicity for Multiwinner Elections.

Dorothea Baumeister, Linus Boes, Christian Laußmann, Simon Rey

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Distortion in Attribute Approval Committee Elections.

Dorothea Baumeister, Linus Boes

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Time-Constrained Participatory Budgeting Under Uncertain Project Costs.

Dorothea Baumeister, Linus Boes, Christian Laußmann

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

On the Average-Case Complexity of Predicting Round-Robin Tournaments.

Dorothea Baumeister, Tobias Hogrebe

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Collective Acceptability in Abstract Argumentation.

Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe

FLAP, 2021

Acceptance in incomplete argumentation frameworks.

Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen, Jörg Rothe

Artif. Intell., 2021

Complexity of Scheduling and Predicting Round-Robin Tournaments.

Dorothea Baumeister, Tobias Alexander Hogrebe

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Complexity of Sequential Rules in Judgment Aggregation.

Dorothea Baumeister, Linus Boes, Robin Weishaupt

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Complexity of Manipulative Interference in Participatory Budgeting.

Dorothea Baumeister, Linus Boes, Johanna Hillebrand

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

2020

Complexity of control in judgment aggregation for uniform premise-based quota rules.

Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe, Ann-Kathrin Selker

J. Comput. Syst. Sci., 2020

Manipulation of Opinion Polls to Influence Iterative Elections.

Dorothea Baumeister, Ann-Kathrin Selker, Anaëlle Wilczynski

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Towards Reality: Smoothed Analysis in Computational Social Choice.

Dorothea Baumeister, Tobias Hogrebe, Jörg Rothe

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Complexity of Election Evaluation and Probabilistic Robustness: Extended Abstract.

Dorothea Baumeister, Tobias Hogrebe

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Irresolute Approval-based Budgeting.

Dorothea Baumeister, Linus Boes, Tessa Seeger

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

How Hard Is the Manipulative Design of Scoring Systems?.

Dorothea Baumeister, Tobias Hogrebe

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Manipulative Design of Scoring Systems.

Dorothea Baumeister, Tobias Hogrebe

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Generalized Distance Bribery.

Dorothea Baumeister, Tobias Hogrebe, Lisa Rey

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Strategy-proofness of scoring allocation correspondences for indivisible goods.

Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe

Soc. Choice Welf., 2018

Verification in incomplete argumentation frameworks.

Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack

Artif. Intell., 2018

Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks.

Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe

Proceedings of the Computational Models of Argument, 2018

Complexity of Verification in Incomplete Argumentation Frameworks.

Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Guest Column: Complexity of Verication in Abstract Argumentation Frameworks.

Dorothea Baumeister

SIGACT News, 2017

Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261).

Dorothea Baumeister, Piotr Faliszewski, Annick Laruelle, Toby Walsh

Dagstuhl Reports, 2017

Positional scoring-based allocation of indivisible goods.

Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe, Abdallah Saffidine

Auton. Agents Multi Agent Syst., 2017

2016

Minisum and Minimax Committee Election Rules for General Preference Types.

Dorothea Baumeister, Toni Böhnlein, Lisa Rey, Oliver Schaudt, Ann-Kathrin Selker

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Preference Aggregation by Voting.

Dorothea Baumeister, Jörg Rothe

Proceedings of the Economics and Computation, 2016

Judgment Aggregation.

Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe

Proceedings of the Economics and Computation, 2016

2015

Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules.

Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe

Math. Soc. Sci., 2015

Voter Dissatisfaction in Committee Elections.

Dorothea Baumeister, Sophie Dennisen

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types.

Dorothea Baumeister, Jörg Rothe, Ann-Kathrin Selker

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Verification in Argument-Incomplete Argumentation Frameworks.

Dorothea Baumeister, Jörg Rothe, Hilmar Schadrack

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Verification in Attack-Incomplete Argumentation Frameworks.

Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Winner Determination and Manipulation in Minisum and Minimax Committee Elections.

Dorothea Baumeister, Sophie Dennisen, Lisa Rey

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014

Scoring Rules for the Allocation of Indivisible Goods.

Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

2013

The Complexity of Computing Minimal Unidirectional Covering Sets.

Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe

Theory Comput. Syst., 2013

Computational Aspects of Manipulation and Control in Judgment Aggregation.

Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe

Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012

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

Dorothea Baumeister

PhD thesis, 2012

Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules.

Dorothea Baumeister, Jörg Rothe

Inf. Process. Lett., 2012

Control in Judgment Aggregation.

Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe

Proceedings of the STAIRS 2012, 2012

Berechnungskomplexität von Problemen in der Computational Social Choice.

Dorothea Baumeister

Proceedings of the Ausgezeichnete Informatikdissertationen 2012, 2012

The Possible Winner Problem with Uncertain Weights.

Dorothea Baumeister, Magnus Roos, Jörg Rothe, Lena Schend, Lirong Xia

Proceedings of the ECAI 2012, 2012

Campaigns for lazy voters: truncated ballots.

Dorothea Baumeister, Piotr Faliszewski, Jérôme Lang, Jörg Rothe

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011

Computational complexity of two variants of the possible winner problem.

Dorothea Baumeister, Magnus Roos, Jörg Rothe

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation.

Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe

Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

Einführung in Computational Social Choice: Individuelle Strategien und kollektive Entscheidungen beim Spielen, Wählen und Teilen.

Jörg Rothe, Dorothea Baumeister, Claudia Lindner, Irene Rothe

Springer Spektrum, ISBN: 978-3-8274-2570-6, 2011

2009

The three-color and two-color Tantrix^TM rotation puzzle problems are NP-complete via parsimonious reductions.

Dorothea Baumeister, Jörg Rothe

Inf. Comput., 2009

Satisfiability Parsimoniously Reduces to the Tantrix^TM Rotation Puzzle Problem.

Dorothea Baumeister, Jörg Rothe

Fundam. Informaticae, 2009

Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP

Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jörg Rothe

CoRR, 2009

2008

The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions.

Dorothea Baumeister, Jörg Rothe

Proceedings of the Language and Automata Theory and Applications, 2008

2007

The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions

Dorothea Baumeister, Jörg Rothe

CoRR, 2007

Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem

Dorothea Baumeister, Jörg Rothe

CoRR, 2007