activity
19982026
most citedControl Complexity in Fallback Voting

35 citations · 200 across the 47 of their papers we have counts for

collaborators

52 papers

cs.GT2026

Navigating the Complexity Landscape of Nominee Selection in Schulze Voting

Katarína Cechlárová, Jörg Rothe, Šimon Schierreich +1

We study the Possible President problem and the Necessary President problem for Schulze voting, a rule that, due to its many desirable axiomatic properties, is popular in practice.…

cs.GT2023

Altruism in Coalition Formation Games

Anna Maria Kerkmann, Simon Cramer, Jörg Rothe

Nguyen et al. [1] introduced altruistic hedonic games in which agents' utilities depend not only on their own preferences but also on those of their friends in the same coalition.…

cs.CC2021★ 1 cited

Stability of Special Graph Classes

Robin Weishaupt, Jörg Rothe

Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $Θ_2^{\text{P}…

cs.CC2019

Complexity of Stability

Fabian Frei, Edith Hemaspaandra, Jörg Rothe

Graph parameters such as the clique number, the chromatic number, and the independence number are central in many areas, ranging from computer networks to linguistics to computatio…

cs.GT2013

The Complexity of Online Manipulation of Sequential Elections

Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe

Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the alr…

cs.GT2013

Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting

Piotr Faliszewski, Yannick Reisch, Jörg Rothe +1

A central theme in computational social choice is to study the extent to which voting systems computationally resist manipulative attacks seeking to influence the outcome of electi…