Jörg Rothe

74 publications

10 venues

H Index 19

Name Venue Year citations
Voting for Centrality. AAMAS 2022 0
Popularity and Strict Popularity in Altruistic Hedonic Games and Minimum-Based Altruistic Hedonic Games. AAMAS 2022 0
Thou Shalt Love Thy Neighbor as Thyself When Thou Playest: Altruism in Game Theory. AAAI 2021 0
Manipulation in Communication Structures of Graph-Restricted Weighted Voting Games. ADT 2021 0
Control complexity in Borda elections: Solving all open cases of offline control and some cases of online control. Artificial Intelligence 2021 3
Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. Autonomous Agents and Multi-Agent Systems 2021 1
Acceptance in incomplete argumentation frameworks. Artificial Intelligence 2021 6
Towards Reality: Smoothed Analysis in Computational Social Choice. AAMAS 2020 7
The Last Voting Rule Is Home: Complexity of Control by Partition of Candidates or Voters in Maximin Elections. ECAI 2020 1
Deciding Acceptance in Incomplete Argumentation Frameworks. AAAI 2020 11
Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types. IJCAI 2020 5
The Complexity of Cloning Candidates in Multiwinner Elections. AAMAS 2020 0
Altruism in Coalition Formation Games. IJCAI 2020 3
Complexity of Possible and Necessary Existence Problems in Abstract Argumentation. ECAI 2020 1
Hedonic Games with Ordinal Preferences and Thresholds. JAIR 2020 4
Optimizing Social Welfare in Social Networks. ADT 2019 3
Stability in FEN-Hedonic Games for Single-Player Deviations. AAMAS 2019 4
Refugee Allocation in the Setting of Hedonic Games. ADT 2019 0
Borda Count in Collective Decision Making: A Summary of Recent Results. AAAI 2019 5
The Complexity of Online Bribery in Sequential Elections (Extended Abstract). TARK 2019 0
Bounds on the Cost of Stabilizing a Cooperative Game. JAIR 2018 3
Verification in incomplete argumentation frameworks. Artificial Intelligence 2018 31
Complexity of Verification in Incomplete Argumentation Frameworks. AAAI 2018 8
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 8
Sequential Allocation Rules are Separable: Refuting a Conjecture on Scoring-Based Allocation of Indivisible Goods. AAMAS 2018 2
Complexity of Shift Bribery in Iterative Elections. AAMAS 2018 25
Approximate Solutions To Max-Min Fair and Proportionally Fair Allocations of Indivisible Goods. AAMAS 2017 18
Solving Seven Open Problems of Offline and Online Control in Borda Elections. AAAI 2017 9
Complexity of Control by Partition of Voters and of Voter Groups in Veto and Other Scoring Protocols. AAMAS 2017 6
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
Local Fairness in Hedonic Games via Individual Threshold Coalitions. AAMAS 2016 5
Altruistic Hedonic Games. AAMAS 2016 19
Structural Control in Weighted Voting Games: (Extended Abstract). AAMAS 2016 1
Complexity of Control by Partitioning Veto and Maximin Elections and of Control by Adding Candidates to Plurality Elections. ECAI 2016 0
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 17
Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds. AAMAS 2015 30
Fairness and Rank-Weighted Utilitarianism in Resource Allocation. ADT 2015 13
Verification in Attack-Incomplete Argumentation Frameworks. ADT 2015 17
Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods. IJCAI 2015 0
Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting. Autonomous Agents and Multi-Agent Systems 2015 0
Scoring Rules for the Allocation of Indivisible Goods. ECAI 2014 16
Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting. AAMAS 2014 44
False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time. JAIR 2014 12
Bribery in multiple-adversary path-disruption games is hard for the second level of the polynomial hierarchy. AAMAS 2014 5
Computational complexity and approximability of social welfare optimization in multiagent resource allocation. Autonomous Agents and Multi-Agent Systems 2014 0
Computational Aspects of Manipulation and Control in Judgment Aggregation. ADT 2013 28
How to Decrease the Degree of Envy in Allocations of Indivisible Goods. ADT 2013 11
The Complexity of Online Manipulation of Sequential Elections. TARK 2013 33
Envy-ratio and average-nash social welfare optimization in multiagent resource allocation. AAMAS 2013 5
Probabilistic Path-Disruption Games. ECAI 2012 3
Online Voter Control in Sequential Elections. ECAI 2012 18
Controlling Candidate-Sequential Elections. ECAI 2012 14
Campaigns for lazy voters: truncated ballots. AAMAS 2012 85
The Possible Winner Problem with Uncertain Weights. ECAI 2012 23
Complexity and approximability of social welfare optimization in multiagent resource allocation. AAMAS 2012 0
Bribery in Path-Disruption Games. ADT 2011 10
How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. ADT 2011 32
How to Calibrate the Scores of Biased Reviewers by Quadratic Programming. AAAI 2011 40
Computational complexity of two variants of the possible winner problem. AAMAS 2011 42
The complexity of voter partition in Bucklin and fallback voting: solving three open problems. AAMAS 2011 31
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. ECAI 2010 1
Complexity of Merging and Splitting for the Probabilistic Banzhaf Power Index in Weighted Voting Games. ECAI 2010 8
Complexity of social welfare optimization in multiagent resource allocation. AAMAS 2010 24
Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols. WINE 2009 8
The Complexity of Probabilistic Lobbying. ADT 2009 40
The shield that never was: societies with single-peaked preferences are more open to manipulation and control. TARK 2009 67
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. JAIR 2009 219
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 227
Copyright ©2019 Universität Würzburg

Impressum | Privacy | FAQ