21 citations · 75 across the 20 of their papers we have counts for
5 papers · 1 filter
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…
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 and Limits to Tractability
Yuri Faenza, Telikepalli Kavitha, Vladlena Powers +1
We consider popular matching problems in both bipartite and non-bipartite graphs with strict preference lists. It is known that every stable matching is a min-size popular matching…
The Popular Roommates problem
Telikepalli Kavitha
We consider the popular matching problem in a roommates instance with strict preference lists. While popular matchings always exist in a bipartite instance, they need not exist in…
Max-size popular matchings and extensions
Telikepalli Kavitha
We consider the max-size popular matching problem in a roommates instance G = (V,E) with strict preference lists. A matching M is popular if there is no matching M' in G such that…