Abstract
Real-life examples of assignment problems, like college admission, the labor market for medical interns, and sorority rush, can be formulated as bipartite matching. The college admission problem is one of many-to-one matching in two-sided matching models. We can obtain a bipartite graph by viewing all colleges and students as two disjointed sets of vertices, and joining an edge between their corresponding vertices, if the student enrolled this college. Thus, the college admission problem can be formulated as finding a stable extensive matching in the corresponding bipartite graph. In this paper, by using the definition of the stable extensive matching, we give an algorithm with O(m3n3) for the college admission problem, which is different from the Gale and Shapley algorithm. Moreover, the algorithm can be viewed as a generalization of Hungarian Algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
