HomeResearch-feedChannelRankingsGCTTHU AI TROpen DataMust Reading

A stable marriage requires communication

Yannai A. Gonczarowski
Yannai A. Gonczarowski
Noam Nisan
Noam Nisan
Rafail Ostrovsky
Rafail Ostrovsky
Will Rosenbaum
Will Rosenbaum

Games and Economic Behavior, pp. 626-647, 2019.

Cited by: 0|Bibtex|Views4|DOI:https://doi.org/10.1016/j.geb.2018.10.013
Other Links: www.sciencedirect.com
Keywords:
Stable marriageStable matchingApproximately stableCommunication complexityDistance to stability

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments