Pratik Ghoshal

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Let G = (A ∪ 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 in G is rank-maximal if it matches the maximum number of applicants to their top-rank post, subject to this, the maximum number of applicants to their second rank post and so on.(More)
  • 1