A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
Introduction to algorithms
The Hospitals/Residents Problem with Ties
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Strong Stability in the Hospitals/Residents Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Constraint Programming Approach to the Hospitals / Residents Problem
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Size Versus Stability in the Marriage Problem
Approximation and Online Algorithms
Weights in stable marriage problems increase manipulation opportunities
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Male optimal and unique stable marriages with partially ordered preferences
CARE@AI'09/CARE@IAT'10 Proceedings of the CARE@AI 2009 and CARE@IAT 2010 international conference on Collaborative agents - research and development
Machine learned job recommendation
Proceedings of the fifth ACM conference on Recommender systems
A (2 - c1/√N)-approximation algorithm for the stable marriage problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A specialised binary constraint for the stable marriage problem
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
An 8/5-approximation algorithm for a hard variant of stable marriage
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Socially stable matchings in the hospitals/residents problem
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
The National Resident Matching Program in the U.S. provides one of the most successful applications of an algorithmic matching process. Under this scheme, graduating medical students are allocated to hospitals, taking into account the ordered preferences of both students and hospitals, so that the resulting matching is stable in a precise technical sense. Variants of this problem arise elsewhere. For example, in the United Kingdom, the students/hospitals problem is more complicated, primarily because students must take on two positions in their pre-registration year, namely a medical post and a surgical post. Hence there is a need for a matching process that assigns each student to one medical and one surgical unit, taking into account varying numbers of posts in the two half years, and students' seasonal preferences, as well as the basic preferences of students and hospital units for each other. This paper describes an algorithmic solution to this new variation on an old theme that uses network flow and graph theoretic methods as well as the traditional stable matching algorithm. The approach described has been implemented and will soon come into use as a centralised matching scheme in Scotland.