Gonczarowski, Yannai A.; Nisan, Noam - Center for the Study of Rationality, Hebrew University … - 2014
The Gale-Shapely algorithm for the Stable Marriage Problem is known to take \Theta(n^2) steps to find a stable marriage in the worst case, but only \Theta(n log n) steps in the average case (with n women and n men). In 1976, Knuth asked whether the worst-case running time can be improved in a...