Capacitated Rank-Maximal Matchings

  title={Capacitated Rank-Maximal Matchings},
  author={Katarzyna E. Paluch},
We consider capacitated rank-maximal matchings. Rank-maximal matchings have been considered before and are defined as follows. We are given a bipartite graph \( G= (\mathcal{A} \cup \mathcal{P}, {\cal E})\), in which \(\mathcal{A}\) denotes applicants, \(\mathcal{P}\) posts and edges have ranks – an edge (a,p) has rank i if p belongs to (one of) a’s ith choices. A matching M is called rank-maximal if the largest possible number of applicants is matched in M to their first choice posts and… CONTINUE READING

Topics from this paper.

Similar Papers