Dorothea Baumeister

According to our database1, Dorothea Baumeister authored at least 42 papers between 2007 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Complexity of control in judgment aggregation for uniform premise-based quota rules.
J. Comput. Syst. Sci., 2020

Manipulation of Opinion Polls to Influence Iterative Elections.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Towards Reality: Smoothed Analysis in Computational Social Choice.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Complexity of Election Evaluation and Probabilistic Robustness: Extended Abstract.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Irresolute Approval-based Budgeting.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
How Hard Is the Manipulative Design of Scoring Systems?.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Manipulative Design of Scoring Systems.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Generalized Distance Bribery.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Strategy-proofness of scoring allocation correspondences for indivisible goods.
Soc. Choice Welf., 2018

Verification in incomplete argumentation frameworks.
Artif. Intell., 2018

Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks.
Proceedings of the Computational Models of Argument, 2018

Complexity of Verification in Incomplete Argumentation Frameworks.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Guest Column: Complexity of Verication in Abstract Argumentation Frameworks.
SIGACT News, 2017

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

Positional scoring-based allocation of indivisible goods.
Auton. Agents Multi Agent Syst., 2017

2016
Minisum and Minimax Committee Election Rules for General Preference Types.
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.
Proceedings of the Economics and Computation, 2016

Judgment Aggregation.
Proceedings of the Economics and Computation, 2016

2015
Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules.
Math. Soc. Sci., 2015

Voter Dissatisfaction in Committee Elections.
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.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Verification in Argument-Incomplete Argumentation Frameworks.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Verification in Attack-Incomplete Argumentation Frameworks.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Winner Determination and Manipulation in Minisum and Minimax Committee Elections.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014
Scoring Rules for the Allocation of Indivisible Goods.
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.
Theory Comput. Syst., 2013

Computational Aspects of Manipulation and Control in Judgment Aggregation.
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.
PhD thesis, 2012

Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules.
Inf. Process. Lett., 2012

Control in Judgment Aggregation.
Proceedings of the STAIRS 2012, 2012

Berechnungskomplexität von Problemen in der Computational Social Choice.
Proceedings of the Ausgezeichnete Informatikdissertationen 2012, 2012

The Possible Winner Problem with Uncertain Weights.
Proceedings of the ECAI 2012, 2012

Campaigns for lazy voters: truncated ballots.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011
Computational complexity of two variants of the possible winner problem.
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.
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.
Springer Spektrum, ISBN: 978-3-8274-2570-6, 2011

2009
The three-color and two-color Tantrix<sup>TM</sup> rotation puzzle problems are NP-complete via parsimonious reductions.
Inf. Comput., 2009

Satisfiability Parsimoniously Reduces to the Tantrix<sup>TM</sup> Rotation Puzzle Problem.
Fundam. Informaticae, 2009

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

2008
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions.
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
CoRR, 2007

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


  Loading...