Gale–Shapley algorithm (Stable Marriage Problem Stable Matching Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(n)$ words
(Only need to keep track of current (provisional) matchings)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1962
Reference
http://www.eecs.harvard.edu/cs286r/courses/fall09/papers/galeshapley.pdf