14 citations · 17 across the 5 of their papers we have counts for
6 papers · 1 filter
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…
Polynomially tractable cases in the popular roommates problem
Erika Bérczi-Kovács, Ágnes Cseh, Kata Kosztolányi +1
The input of the popular roommates problem consists of a graph and for each vertex , strict preferences over the neighbors of . Matching is more popular…
The stable marriage problem with ties and restricted edges
Ágnes Cseh, Klaus Heeger
In the stable marriage problem, a set of men and a set of women are given, each of whom has a strictly ordered preference list over the acceptable agents in the opposite class. A m…
Pairwise preferences in the stable marriage problem
Ágnes Cseh, Attila Juhos
We study the classical, two-sided stable marriage problem under pairwise preferences. In the most general setting, agents are allowed to express their preferences as comparisons of…
Popular Matchings in Complete Graphs
Ágnes Cseh, Telikepalli Kavitha
Our input is a complete graph on vertices where each vertex has a strict ranking of all other vertices in . Our goal is to construct a matching in that is po…
Popular matchings with two-sided preferences and one-sided ties
Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha
We are given a bipartite graph where each vertex has a preference list ranking its neighbors: in particular, every ranks its neighbors in a strict ord…