activity
20082026
most citedComplexity of Stability in Trading Networks

5 citations · 17 across the 24 of their papers we have counts for

collaborators
Showing 2025Show all

7 papers · 1 filter

cs.GT2025

Solving Four Open Problems about Core Stability in Altruistic Hedonic Games

Jörg Rothe, Ildikó Schlotter

Hedonic games -- at the interface of cooperative game theory and computational social choice -- are coalition formation games in which the players have preferences over the coaliti…

cs.GT2025

Computing Equilibrium Nominations in Presidential Elections

Piotr Faliszewski, Stanislaw Kazmierowski, Grzegorz Lisowski +2

We study strategic candidate nomination by parties in elections decided by Plurality voting. Each party selects a nominee before the election, and the winner is chosen from the nom…

cs.GT2025

Identifying Imperfect Clones in Elections

Piotr Faliszewski, Lukasz Janeczko, Grzegorz Lisowski +2

A perfect clone in an ordinal election (i.e., an election where the voters rank the candidates in a strict linear order) is a set of candidates that each voter ranks consecutively.…

cs.GT2025

The Strong Core of Housing Markets with Partial Order Preferences

Ildikó Schlotter, Lydia Mirabel Mendoza-Cadena

We study the strong core of housing markets when agents' preferences over houses are expressed as partial orders. We provide a structural characterization of the strong core, and p…

cs.GT2025

Candidate nomination for Condorcet-consistent voting rules

Ildikó Schlotter, Katarína Cechlárová

Consider elections where the set of candidates is partitioned into parties, and each party must nominate exactly one candidate. The Possible President problem asks whether some can…

cs.GT2025

Control and Bribery in Stable Marriage and Stable Roommates: A Complete Complexity Landscape

Jiehua Chen, Ildikó Schlotter

We study control and bribery problems for stable matchings: A central authority (the controller, resp. briber) may add agents, delete agents, delete acceptable pairs, swap two adja…

cs.GT2025

Stable Hypergraph Matching in Unimodular Hypergraphs

Péter Biró, Gergely Csáji, Ildikó Schlotter

We study the NP-hard Stable Hypergraph Matching (SHM) problem and its generalization allowing capacities, the Stable Hypergraph -Matching (SHM) problem, and investigate their…