Dorothea Baumeister

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

2022

Time-Constrained Participatory Budgeting Under Uncertain Project Costs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

2021

Collective Acceptability in Abstract Argumentation.

[BibT_eX]

[DOI]

Daniel Neugebauer

FLAP, 2021

Acceptance in incomplete argumentation frameworks.

[BibT_eX]

[DOI]

Artif. Intell., 2021

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

[BibT_eX]

[DOI]

Proceedings of the Multi-Agent Systems - 18th European Conference, 2021

Complexity of Scheduling and Predicting Round-Robin Tournaments.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Robin Weishaupt

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

Complexity of Manipulative Interference in Participatory Budgeting.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ann-Kathrin Selker

J. Comput. Syst. Sci., 2020

Manipulation of Opinion Polls to Influence Iterative Elections.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

Complexity of Election Evaluation and Probabilistic Robustness: Extended Abstract.

[BibT_eX]

[DOI]

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

Irresolute Approval-based Budgeting.

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

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

Manipulative Design of Scoring Systems.

[BibT_eX]

[DOI]

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

Generalized Distance Bribery.

[BibT_eX]

[DOI]

Lisa Rey

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

2018

Verification in incomplete argumentation frameworks.

[BibT_eX]

[DOI]

Artif. Intell., 2018

Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks.

[BibT_eX]

[DOI]

Daniel Neugebauer

Proceedings of the Computational Models of Argument, 2018

Complexity of Verification in Incomplete Argumentation Frameworks.

[BibT_eX]

[DOI]

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

2017

Guest Column: Complexity of Verication in Abstract Argumentation Frameworks.

[BibT_eX]

[DOI]

SIGACT News, 2017

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2017

Positional scoring-based allocation of indivisible goods.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2017

2016

Minisum and Minimax Committee Election Rules for General Preference Types.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Economics and Computation, 2016

Judgment Aggregation.

[BibT_eX]

[DOI]

Proceedings of the Economics and Computation, 2016

2015

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

[BibT_eX]

[DOI]

Math. Soc. Sci., 2015

Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods.

[BibT_eX]

[DOI]

Nhan-Tam Nguyen

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Voter Dissatisfaction in Committee Elections.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ann-Kathrin Selker

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

Verification in Argument-Incomplete Argumentation Frameworks.

[BibT_eX]

[DOI]

Hilmar Schadrack

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

Verification in Attack-Incomplete Argumentation Frameworks.

[BibT_eX]

[DOI]

Daniel Neugebauer

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

Winner Determination and Manipulation in Minisum and Minimax Committee Elections.

[BibT_eX]

[DOI]

Sophie Dennisen

Lisa Rey

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

2014

Scoring Rules for the Allocation of Indivisible Goods.

[BibT_eX]

[DOI]

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

2013

Computational Aspects of Manipulation and Control in Judgment Aggregation.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

PhD thesis, 2012

Control in Judgment Aggregation.

[BibT_eX]

[DOI]

Proceedings of the STAIRS 2012, 2012

Berechnungskomplexität von Problemen in der Computational Social Choice.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2012, 2012

The Possible Winner Problem with Uncertain Weights.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2012, 2012

Campaigns for lazy voters: truncated ballots.

[BibT_eX]

[DOI]

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

2011

Computational complexity of two variants of the possible winner problem.

[BibT_eX]

[DOI]

Magnus Roos

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

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

2010

Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2010, 2010

The Complexity of Computing Minimal Unidirectional Covering Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

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

[BibT_eX]

[DOI]

Inf. Comput., 2009

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

[BibT_eX]

[DOI]

CoRR, 2009

2008

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

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

CoRR, 2007

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

[BibT_eX]

[DOI]

CoRR, 2007

Satisfiability Parsimoniously Reduces to the Tantrix<sup>TM</sup> Rotation Puzzle Problem.

[BibT_eX]

[DOI]