13 citations · 24 across the 22 of their papers we have counts for
4 papers · 1 filter
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters
Robert Bredereck, Klaus Heeger, Dušan Knop +1
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier…
Adapting Stable Matchings to Evolving Preferences
Robert Bredereck, Jiehua Chen, Dušan Knop +2
Adaptivity to changing environments and constraints is key to success in modern society. We address this by proposing "incrementalized versions" of Stable Marriage and Stable Roomm…
Stable Roommates with Narcissistic, Single-Peaked, and Single-Crossing Preferences
Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl +1
The classical Stable Roommates problem is to decide whether there exists a matching of an even number of agents such that no two agents which are not matched to each other would pr…
Hedonic Diversity Games
Robert Bredereck, Edith Elkind, Ayumi Igarashi
We consider a coalition formation setting where each agent belongs to one of the two types, and agents' preferences over coalitions are determined by the fraction of the agents of…