Rank-Maximal Matchings - Structure and Algorithms

@inproceedings{Ghosal2014RankMaximalM,
  title={Rank-Maximal Matchings - Structure and Algorithms},
  author={Pratik Ghosal and Meghana Nasre and Prajakta Nimbhorkar},
  booktitle={ISAAC},
  year={2014}
}
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 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. In this paper, we develop a switching graph characterization of rank-maximal matchings, which is a useful tool that encodes all rank-maximal… CONTINUE READING
1
Twitter Mention

Figures and Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Rank maximal matchings – structure and algorithms

P. Ghoshal, M. Nasre, P. Nimbhorkar
  • CoRR, abs/1409.4977,
  • 2014
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Greedy matchings

R. W. Irving
  • Technical Report, University of Glasgow, TR2003-136,
  • 2003
VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

Rankmaximal matchings

R. W. Irving, T. Kavitha, K. Mehlhorn, D. Michail, K. E. Paluch
  • ACM Transactions on Algorithms, 2(4):602–610,
  • 2006
VIEW 13 EXCERPTS
HIGHLY INFLUENTIAL

Optimal popular matchings

  • Discrete Applied Mathematics
  • 2009
VIEW 1 EXCERPT