Rank Maximal Matchings -- Structure and Algorithms

Pratik Ghoshal, Meghana Nasre, Prajakta Nimbhorkar

Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and ranks on the edges denote preferences of the agents over posts. A matching M i…