5 citations · 6 across the 5 of their papers we have counts for
1 paper · 1 filter
Rafail Ostrovsky, Will Rosenbaum
In their seminal work on the Stable Marriage Problem, Gale and Shapley describe an algorithm which finds a stable matching in O(n2) communication rounds. Their algorithm has a n…