21 citations · 75 across the 20 of their papers we have counts for
1 paper · 2 filters
Telikepalli Kavitha, Rohit Vaish
Given a graph G=(V,E) 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…