Jörg Rothe
90 publications
10 venues
H Index 21
Affiliation
University of D sseldorf, GermanyLinks
| Name | Venue | Year | citations |
|---|---|---|---|
District-Limited Bribery in Multidistrict Apportionment Elections with Threshold.
|
ECAI | 2025 | 0 |
| Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments.
|
TARK | 2025 | 0 |
| Solving Four Open Problems about Core Stability in Altruistic Hedonic Games.
|
TARK | 2025 | 0 |
| Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games.
|
JAIR | 2025 | 2 |
| Control in Computational Social Choice.
|
IJCAI | 2025 | 0 |
| Control by Deleting Players from Weighted Voting Games Is NP
|
ECAI | 2025 | 0 |
| Complexity of Candidate Control for Single Nontransferable Vote and Bloc Voting.
|
ADT | 2024 | 2 |
| Complexity and Approximation Schemes for Social Welfare Maximization in the High-Multiplicity Setting.
|
ECAI | 2024 | 0 |
| Toward Completing the Picture of Control in Schulze and Ranked Pairs Elections.
|
IJCAI | 2024 | 2 |
| The complexity of verifying popularity and strict popularity in altruistic hedonic games.
|
Autonomous Agents and Multi-Agent Systems | 2024 | 1 |
| NP
|
AAMAS | 2024 | 0 |
| Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NP
|
ECAI | 2024 | 0 |
| Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey.
|
IJCAI | 2023 | 17 |
| Fair and efficient allocation with few agent types, few item types, or small value levels.
|
Artificial Intelligence | 2023 | 5 |
| Complexity of Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games.
|
ECAI | 2023 | 4 |
| Voting for Centrality.
|
AAMAS | 2022 | 0 |
| Popularity and Strict Popularity in Altruistic Hedonic Games and Minimum-Based Altruistic Hedonic Games.
|
AAMAS | 2022 | 3 |
| Altruistic Hedonic Games.
|
JAIR | 2022 | 0 |
| Acceptance in incomplete argumentation frameworks.
|
Artificial Intelligence | 2021 | 66 |
| Thou Shalt Love Thy Neighbor as Thyself When Thou Playest: Altruism in Game Theory.
|
AAAI | 2021 | 14 |
| Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters.
|
Autonomous Agents and Multi-Agent Systems | 2021 | 18 |
| Control complexity in Borda elections: Solving all open cases of offline control and some cases of online control.
|
Artificial Intelligence | 2021 | 18 |
| Manipulation in Communication Structures of Graph-Restricted Weighted Voting Games.
|
ADT | 2021 | 0 |
| Towards Reality: Smoothed Analysis in Computational Social Choice.
|
AAMAS | 2020 | 13 |
| The Complexity of Cloning Candidates in Multiwinner Elections.
|
AAMAS | 2020 | 1 |
| Altruism in Coalition Formation Games.
|
IJCAI | 2020 | 18 |
| Hedonic Games with Ordinal Preferences and Thresholds.
|
JAIR | 2020 | 21 |
| Complexity of Possible and Necessary Existence Problems in Abstract Argumentation.
|
ECAI | 2020 | 2 |
| Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types.
|
IJCAI | 2020 | 9 |
| The Last Voting Rule Is Home: Complexity of Control by Partition of Candidates or Voters in Maximin Elections.
|
ECAI | 2020 | 5 |
| Deciding Acceptance in Incomplete Argumentation Frameworks.
|
AAAI | 2020 | 16 |
| Stability in FEN-Hedonic Games for Single-Player Deviations.
|
AAMAS | 2019 | 6 |
| Optimizing Social Welfare in Social Networks.
|
ADT | 2019 | 8 |
| Refugee Allocation in the Setting of Hedonic Games.
|
ADT | 2019 | 3 |
| Borda Count in Collective Decision Making: A Summary of Recent Results.
|
AAAI | 2019 | 15 |
| The Complexity of Online Bribery in Sequential Elections (Extended Abstract).
|
TARK | 2019 | 0 |
| Verification in incomplete argumentation frameworks.
|
Artificial Intelligence | 2018 | 76 |
| Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods.
|
Autonomous Agents and Multi-Agent Systems | 2018 | 17 |
| Complexity of Shift Bribery in Iterative Elections.
|
AAMAS | 2018 | 23 |
| Sequential Allocation Rules are Separable: Refuting a Conjecture on Scoring-Based Allocation of Indivisible Goods.
|
AAMAS | 2018 | 2 |
| Complexity of Verification in Incomplete Argumentation Frameworks.
|
AAAI | 2018 | 12 |
| Bounds on the Cost of Stabilizing a Cooperative Game.
|
JAIR | 2018 | 10 |
| Solving Seven Open Problems of Offline and Online Control in Borda Elections.
|
AAAI | 2017 | 12 |
| Approximate Solutions To Max-Min Fair and Proportionally Fair Allocations of Indivisible Goods.
|
AAMAS | 2017 | 21 |
| Complexity of Control by Partition of Voters and of Voter Groups in Veto and Other Scoring Protocols.
|
AAMAS | 2017 | 7 |
| The complexity of online voter control in sequential elections.
|
Autonomous Agents and Multi-Agent Systems | 2017 | 0 |
| Positional scoring-based allocation of indivisible goods.
|
Autonomous Agents and Multi-Agent Systems | 2017 | 0 |
| Altruistic Hedonic Games.
|
AAMAS | 2016 | 39 |
| Local Fairness in Hedonic Games via Individual Threshold Coalitions.
|
AAMAS | 2016 | 10 |
| Structural Control in Weighted Voting Games: (Extended Abstract).
|
AAMAS | 2016 | 0 |
| Complexity of Control by Partitioning Veto and Maximin Elections and of Control by Adding Candidates to Plurality Elections.
|
ECAI | 2016 | 0 |
| Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds.
|
AAMAS | 2015 | 36 |
| Fairness and Rank-Weighted Utilitarianism in Resource Allocation.
|
ADT | 2015 | 17 |
| 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 |
| Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting.
|
Autonomous Agents and Multi-Agent Systems | 2015 | 0 |
| Bribery in multiple-adversary path-disruption games is hard for the second level of the polynomial hierarchy.
|
AAMAS | 2014 | 6 |
| Scoring Rules for the Allocation of Indivisible Goods.
|
ECAI | 2014 | 19 |
| Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting.
|
AAMAS | 2014 | 0 |
| False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time.
|
JAIR | 2014 | 0 |
| Computational complexity and approximability of social welfare optimization in multiagent resource allocation.
|
Autonomous Agents and Multi-Agent Systems | 2014 | 0 |
| Envy-ratio and average-nash social welfare optimization in multiagent resource allocation.
|
AAMAS | 2013 | 6 |
| How to Decrease the Degree of Envy in Allocations of Indivisible Goods.
|
ADT | 2013 | 13 |
| Computational Aspects of Manipulation and Control in Judgment Aggregation.
|
ADT | 2013 | 27 |
| The Complexity of Online Manipulation of Sequential Elections.
|
TARK | 2013 | 0 |
| Controlling Candidate-Sequential Elections.
|
ECAI | 2012 | 14 |
| The Possible Winner Problem with Uncertain Weights.
|
ECAI | 2012 | 27 |
| Probabilistic Path-Disruption Games.
|
ECAI | 2012 | 5 |
| Campaigns for lazy voters: truncated ballots.
|
AAMAS | 2012 | 105 |
| Online Voter Control in Sequential Elections.
|
ECAI | 2012 | 21 |
| Complexity and approximability of social welfare optimization in multiagent resource allocation.
|
AAMAS | 2012 | 0 |
| Bribery in Path-Disruption Games.
|
ADT | 2011 | 10 |
| Computational complexity of two variants of the possible winner problem.
|
AAMAS | 2011 | 47 |
| The complexity of voter partition in Bucklin and fallback voting: solving three open problems.
|
AAMAS | 2011 | 33 |
| How to Calibrate the Scores of Biased Reviewers by Quadratic Programming.
|
AAAI | 2011 | 48 |
| How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation.
|
ADT | 2011 | 31 |
| Complexity of social welfare optimization in multiagent resource allocation.
|
AAMAS | 2010 | 29 |
| Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules.
|
ECAI | 2010 | 81 |
| Complexity of Merging and Splitting for the Probabilistic Banzhaf Power Index in Weighted Voting Games.
|
ECAI | 2010 | 9 |
| The Complexity of Probabilistic Lobbying.
|
ADT | 2009 | 49 |
| Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols.
|
WINE | 2009 | 9 |
| Llull and Copeland Voting Computationally Resist Bribery and Constructive Control.
|
JAIR | 2009 | 237 |
| The shield that never was: societies with single-peaked preferences are more open to manipulation and control.
|
TARK | 2009 | 155 |
| The cost of stability in weighted voting games.
|
AAMAS | 2009 | 29 |
| Llull and Copeland Voting Broadly Resist Bribery and Control.
|
AAAI | 2007 | 54 |
| Hybrid Elections Broaden Complexity-Theoretic Resistance to Control.
|
IJCAI | 2007 | 0 |
| Anyone but him: The complexity of precluding an alternative.
|
Artificial Intelligence | 2007 | 0 |
| Anyone but Him: The Complexity of Precluding an Alternative.
|
AAAI | 2005 | 252 |