Dorothea Baumeister
32 publications
7 venues
H Index 14
Affiliation
University of D sseldorf, GermanyLinks
| Name | Venue | Year | citations |
|---|---|---|---|
Distortion in Attribute Approval Committee Elections.
|
AAMAS | 2023 | 0 |
| Bounded Approval Ballots: Balancing Expressiveness and Simplicity for Multiwinner Elections.
|
AAMAS | 2023 | 2 |
| Time-Constrained Participatory Budgeting Under Uncertain Project Costs.
|
IJCAI | 2022 | 4 |
| On the Average-Case Complexity of Predicting Round-Robin Tournaments.
|
AAMAS | 2022 | 1 |
| Acceptance in incomplete argumentation frameworks.
|
Artificial Intelligence | 2021 | 66 |
| Complexity of Sequential Rules in Judgment Aggregation.
|
AAMAS | 2021 | 1 |
| Complexity of Scheduling and Predicting Round-Robin Tournaments.
|
AAMAS | 2021 | 5 |
| Complexity of Manipulative Interference in Participatory Budgeting.
|
ADT | 2021 | 5 |
| Manipulation of Opinion Polls to Influence Iterative Elections.
|
AAMAS | 2020 | 7 |
| Towards Reality: Smoothed Analysis in Computational Social Choice.
|
AAMAS | 2020 | 13 |
| Complexity of Election Evaluation and Probabilistic Robustness: Extended Abstract.
|
AAMAS | 2020 | 7 |
| Irresolute Approval-based Budgeting.
|
AAMAS | 2020 | 11 |
| Generalized Distance Bribery.
|
AAAI | 2019 | 12 |
| How Hard Is the Manipulative Design of Scoring Systems?.
|
IJCAI | 2019 | 4 |
| Manipulative Design of Scoring Systems.
|
AAMAS | 2019 | 1 |
| Verification in incomplete argumentation frameworks.
|
Artificial Intelligence | 2018 | 76 |
| Complexity of Verification in Incomplete Argumentation Frameworks.
|
AAAI | 2018 | 12 |
| Positional scoring-based allocation of indivisible goods.
|
Autonomous Agents and Multi-Agent Systems | 2017 | 0 |
| Minisum and Minimax Committee Election Rules for General Preference Types.
|
ECAI | 2016 | 9 |
| Winner Determination and Manipulation in Minisum and Minimax Committee Elections.
|
ADT | 2015 | 15 |
| Voter Dissatisfaction in Committee Elections.
|
AAMAS | 2015 | 15 |
| Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types.
|
ADT | 2015 | 5 |
| Verification in Argument-Incomplete Argumentation Frameworks.
|
ADT | 2015 | 19 |
| Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods.
|
IJCAI | 2015 | 18 |
| Verification in Attack-Incomplete Argumentation Frameworks.
|
ADT | 2015 | 18 |
| Scoring Rules for the Allocation of Indivisible Goods.
|
ECAI | 2014 | 19 |
| Computational Aspects of Manipulation and Control in Judgment Aggregation.
|
ADT | 2013 | 27 |
| The Possible Winner Problem with Uncertain Weights.
|
ECAI | 2012 | 27 |
| Campaigns for lazy voters: truncated ballots.
|
AAMAS | 2012 | 105 |
| Computational complexity of two variants of the possible winner problem.
|
AAMAS | 2011 | 47 |
| How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation.
|
ADT | 2011 | 31 |
| Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules.
|
ECAI | 2010 | 81 |