21 citations · 75 across the 20 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
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…
cs.GT2021
Semi-Popular Matchings and Copeland Winners
Telikepalli Kavitha, Rohit Vaish
Given a graph where every vertex has a weak ranking over its neighbors, we consider the problem of computing an optimal matching as per agent preferences. Classical not…