activity
20082026
most citedComplexity of Stability in Trading Networks

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

collaborators
Showing 2026Show all

6 papers · 1 filter

cs.GT2026

Nearly Group-Separable Elections

Piotr Faliszewski, Jan Jabrocki, Stanisław Kaźmierowski +3

We study the problem of computing how close a given election is to being group-separable, measuring proximity by swaps of adjacent candidates in the votes. We also consider several…

cs.GT2026

Individual Rationality in Constrained Hedonic Games: Friends, Enemies, and Neutrals

Šimon Schierreich, Ildikó Schlotter

We study constrained coalition formation in games induced by friends, enemies, and neutrals, under the two standard refinements of additively separable preferences: friend-oriented…

cs.SI2026

What Makes Majority Illusion Easy to Detect?

Šimon Schierreich, Ildikó Schlotter

Majority illusion is an undesirable phenomenon in social networks in which agents incorrectly perceive a minority opinion as dominant. This can severely distort collective behavior…

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.GT2026

Optimal Portfolio Compression for Priority-Proportional Clearing with Defaulting Costs

Gergely Csáji, Rareş-Ioan Mateiu, Alexandru Popa +1

We study financial networks where banks are connected through bilateral liabilities and may default when resources are insufficient to meet obligations. We consider both the standa…

cs.GT2026

Necessary President in Elections with Parties

Katarína Cechlárová, Ildikó Schlotter

Consider an election where the set of candidates is partitioned into parties, and each party must choose exactly one candidate to nominate for the election held over all nominees.…