5 citations · 17 across the 24 of their papers we have counts for
31 papers
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…
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…
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…
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.…
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…
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.…
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…
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…
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.…
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…
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…
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…
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…
Parameterized Algorithms for Optimal Refugee Resettlement
Jiehua Chen, Ildikó Schlotter, Sofia Simola
We study variants of the Optimal Refugee Resettlement problem where a set of refugee families need to be allocated to a set of possible places of resettlement in a feasible…
Parameterized Complexity of Submodular Minimization under Uncertainty
Naonori Kakimura, Ildikó Schlotter
This paper studies the computational complexity of a robust variant of a two-stage submodular minimization problem that we call Robust Submodular Minimizer. In this problem, we are…
Arborescences, Colorful Forests, and Popularity
Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter +1
Our input is a directed, rooted graph where each vertex in has a partial order preference over its incoming edges. The preferences of a vertex extend nat…
Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions
Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena +3
We consider the Shortest Odd Path problem, where given an undirected graph , a weight function on its edges, and two vertices and in , the aim is to find an -p…
Shortest two disjoint paths in conservative graphs
Ildikó Schlotter
We consider the following problem that we call the Shortest Two Disjoint Paths problem: given an undirected graph with edge weights , two term…
Recognizing when a preference system is close to admitting a master list
Ildikó Schlotter
A preference system is an undirected graph where vertices have preferences over their neighbors, and admits a master list if all preferences can be deri…
Odd Paths, Cycles and -joins: Connections and Algorithms
Ildikó Schlotter, András Sebő
Minimizing the weight of an edge set satisfying parity constraints is a challenging branch of combinatorial optimization as witnessed by the binary hypergraph chapter of Alexander…
Maximum-utility popular matchings with bounded instability
Ildikó Schlotter, Ágnes Cseh
In a graph where vertices have preferences over their neighbors, a matching is called popular if it does not lose a head-to-head election against any other matching when the vertic…
The popular assignment problem: when cardinality is more important than popularity
Telikepalli Kavitha, Tamás Király, Jannik Matuschke +2
We consider a matching problem in a bipartite graph where nodes in are agents having preferences in partial order over their neighbors, while nodes in are o…
The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
Ildikó Schlotter, Péter Biró, Tamás Fleiner
We study housing markets as introduced by Shapley and Scarf (1974). We investigate the computational complexity of various questions regarding the situation of an agent in a ho…
Popular Branchings and Their Dual Certificates
Telikepalli Kavitha, Tamás Király, Jannik Matuschke +2
Let be a digraph where every node has preferences over its incoming edges. The preferences of a node extend naturally to preferences over branchings, i.e., directed forests; a…