A stable marriage requires communication
Games and Economic Behavior, pp. 626-647, 2019.
In 1976, Knuth asked whether the worst-case running-time of the Gale-Shapley algorithm for the Stable Marriage Problem can be improved when non-sequential access to the input is allowed. Partial negative answers were given by Ng and Hirschberg and as part of Segal's general communication-complexity analysis. We give a far simpler, yet sig...More
Full Text (Upload PDF)
PPT (Upload PPT)