Hard variants of stable marriage
By David F. Manlove, Robert W. Irving, K. Iwama, S. Miyazaki, Yasufumi Morita. Theoretical Computer Science, 2002
336 citations recorded by the source corpus.
Subfields: Economics and Econometrics, Management Science and Operations Research
View Paper: https://www.semanticscholar.org/paper/a52e97218f76e0de6f952a55fabea5a12e9e3d33
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Economics and Econometrics
In Management Science and Operations Research
Citations in the corpus
- Algorithmics of Matching Under Preferences (2013, methodology): “mits an approximation algorithm with a performance guarantee of 2 [419]: namely, break the ties in a given instance I of smti arbitrarily and run the Gale–Shapley algorithm in the resulting instance of smi to obtain a stable matching M .”
- A Survey of the Stable Marriage Problem and Its Variants (2008, background): “In contrast, the sex-equal stable matching problem is NP-hard [41].”