Popularity at Minimum Cost

Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar

We consider an extension of the {\em popular matching} problem in this paper. The input to the popular matching problem is a bipartite graph G = (A U B,E), where A is a set of peop…