14 citations · 28 across the 17 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DM2018
Understanding popular matchings via stable matchings
Agnes Cseh, Yuri Faenza, Telikepalli Kavitha +1
Let be an instance of the stable marriage problem with strict preference lists. A matching is popular in if does not lose a head-to-head election ag…
cs.DM2018
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…
cs.DM2018
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…