# Jörg Rothe

According to our database

Collaborative distances:

^{1}, Jörg Rothe authored at least 184 papers between 1994 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

J. Artif. Intell. Res., 2020

The price to pay for forgoing normalization in fair division of indivisible goods.

Ann. Math. Artif. Intell., 2020

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types.

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters.

Proceedings of the Computer Science - Theory and Applications, 2020

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

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

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

CoRR, 2019

Proceedings of the Proceedings Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge, 2019

CoRR, 2019

AI Commun., 2019

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

Proceedings of the Algorithmic Decision Theory - 6th International Conference, 2019

Proceedings of the Algorithmic Decision Theory - 6th International Conference, 2019

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

2018

Soc. Choice Welf., 2018

Math. Soc. Sci., 2018

J. Artif. Intell. Res., 2018

Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections.

Ann. Math. Artif. Intell., 2018

Artif. Intell., 2018

Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods.

Auton. Agents Multi Agent Syst., 2018

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

Proceedings of the Computational Models of Argument, 2018

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Sequential Allocation Rules are Separable: Refuting a Conjecture on Scoring-Based Allocation of Indivisible Goods.

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Monotonicity, Duplication Monotonicity, and Pareto Optimality in the Scoring-Based Allocation of Indivisible Goods.

Proceedings of the Agreement Technologies - 6th International Conference, 2018

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

2017

Theor. Comput. Sci., 2017

Theory Comput. Syst., 2017

Auton. Agents Multi Agent Syst., 2017

Auton. Agents Multi Agent Syst., 2017

Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

Approximate Solutions To Max-Min Fair and Proportionally Fair Allocations of Indivisible Goods.

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Complexity of Control by Partition of Voters and of Voter Groups in Veto and Other Scoring Protocols.

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Proceedings of the Handbook of Computational Social Choice, 2016

Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games.

Ann. Math. Artif. Intell., 2016

Proceedings of the STAIRS 2016, 2016

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

Complexity of Control by Partitioning Veto and Maximin Elections and of Control by Adding Candidates to Plurality Elections.

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Proceedings of the Economics and Computation, 2016

Proceedings of the Economics and Computation, 2016

Proceedings of the Economics and Computation, 2016

Proceedings of the Economics and Computation, 2016

Proceedings of the Economics and Computation, 2016

Proceedings of the Economics and Computation, 2016

Proceedings of the Economics and Computation, 2016

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

J. Comput. Syst. Sci., 2015

J. Comput. Syst. Sci., 2015

Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting.

Auton. Agents Multi Agent Syst., 2015

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

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 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

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

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

2014

J. Comput. Syst. Sci., 2014

False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time.

J. Artif. Intell. Res., 2014

Discret. Optim., 2014

Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods.

Discret. Appl. Math., 2014

Computational complexity and approximability of social welfare optimization in multiagent resource allocation.

Auton. Agents Multi Agent Syst., 2014

The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity of the Regular and Exact Variants.

Proceedings of the STAIRS 2014, 2014

Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games.

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

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

Bribery in multiple-adversary path-disruption games is hard for the second level of the polynomial hierarchy.

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Theory Comput. Syst., 2013

Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey.

Ann. Math. Artif. Intell., 2013

A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation.

Ann. Math. Artif. Intell., 2013

Algorithms, approximation, and empirical studies in behavioral and computational social choice - Preface.

Ann. Math. Artif. Intell., 2013

Proceedings of the Fundamental Problems in Computing, 2013

Envy-ratio and average-nash social welfare optimization in multiagent resource allocation.

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012

Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules.

Inf. Process. Lett., 2012

Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach.

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Complexity and Approximability of Egalitarian Nash Product Social Welfare Optimization in Multiagent Resource Allocation.

Proceedings of the STAIRS 2012, 2012

Proceedings of the STAIRS 2012, 2012

Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey.

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

Proceedings of the ECAI 2012, 2012

Proceedings of the ECAI 2012, 2012

Proceedings of the ECAI 2012, 2012

Proceedings of the ECAI 2012, 2012

Complexity and approximability of social welfare optimization in multiagent resource allocation.

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

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

2011

The shield that never was: Societies with single-peaked preferences are more open to manipulation and control.

Inf. Comput., 2011

CoRR, 2011

The complexity of voter partition in Bucklin and fallback voting: solving three open problems.

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Proceedings of the Algorithmic Decision Theory - Second International Conference, 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

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 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

2010

CoRR, 2010

CoRR, 2010

Merging and Splitting for Power Indices in Weighted Voting Games and Network Flow Games on Hypergraphs.

Proceedings of the STAIRS 2010, 2010

Complexity of Merging and Splitting for the Probabilistic Banzhaf Power Index in Weighted Voting Games.

Proceedings of the ECAI 2010, 2010

Proceedings of the Theory of Computing 2010, 2010

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

eXamen.press, Springer, ISBN: 978-3-642-04499-1, 2010

2009

Theor. Comput. Sci., 2009

Math. Log. Q., 2009

Math. Log. Q., 2009

Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control.

Math. Log. Q., 2009

Llull and Copeland Voting Computationally Resist Bribery and Constructive Control.

J. Artif. Intell. Res., 2009

Inf. Process. Lett., 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. Inform., 2009

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

CoRR, 2009

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008

Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions.

Theor. Comput. Sci., 2008

CoRR, 2008

Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas

CoRR, 2008

Proceedings of the Mathematical Foundations of Computer Science 2008, 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

Proceedings of the Algorithmic Aspects in Information and Management, 2008

eXamen.press, Springer, ISBN: 978-3-540-79744-9, 2008

2007

Review of "Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh", Cambridge University Press, 2006, 292 pages.

SIGACT News, 2007

Inf. Process. Lett., 2007

ACM Comput. Surv., 2007

The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions

CoRR, 2007

CoRR, 2007

Artif. Intell., 2007

On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time.

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Theor. Comput. Sci., 2006

Computational Challenges of Massive Data Sets and Randomness in Computation (J.UCS Special Issue on the First and Second Japanese-German Frontiers of Science Symposia).

J. UCS, 2006

Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem.

J. UCS, 2006

Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey.

J. UCS, 2006

Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP.

RAIRO Theor. Informatics Appl., 2006

On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P.

Inf. Process. Lett., 2006

Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems.

Electronic Colloquium on Computational Complexity (ECCC), 2006

2005

Electronic Colloquium on Computational Complexity (ECCC), 2005

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory.

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-28520-5, 2005

2004

Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy.

Proceedings of the Algebraic Methods in Computational Complexity, 10.-15. October 2004, 2004

2003

Theory Comput. Syst., 2003

Inf. Process. Lett., 2003

2002

Theory Comput. Syst., 2002

Inf. Process. Lett., 2002

Inform. Spektrum, 2002

Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem

Electronic Colloquium on Computational Complexity (ECCC), 2002

ACM Comput. Surv., 2002

Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections.

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001

Electronic Colloquium on Computational Complexity (ECCC), 2001

CoRR, 2001

Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions.

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

Theor. Comput. Sci., 2000

Theor. Comput. Sci., 2000

Inf. Process. Lett., 2000

Inf. Comput., 2000

Chic. J. Theor. Comput. Sci., 2000

1999

One-way functions in worst-case cryptography: algebraic and security properties are on the house.

SIGACT News, 1999

Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory.

J. Comput. Syst. Sci., 1999

RAIRO Theor. Informatics Appl., 1999

CoRR, 1999

CoRR, 1999

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998

Theor. Comput. Sci., 1998

Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP.

Inf. Process. Lett., 1998

Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function

CoRR, 1998

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

SIGACT News, 1997

SIAM J. Comput., 1997

J. UCS, 1997

Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP.

J. ACM, 1997

Acta Informatica, 1997

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

Electronic Colloquium on Computational Complexity (ECCC), 1996

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

PhD thesis, 1995

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Inf. Process. Lett., 1994