Stable matching problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Stable matching problem" in English language version.

refsWebsite

Global rank English rank

11doi.org

2^nd place

6ams.org

451^st place

277^th place

4jstor.org

26^th place

20^th place

1ucsd.edu

1,933^rd place

1,342^nd place

1princeton.edu

741^st place

577^th place

1stanford.edu

179^th place

183^rd place

1gla.ac.uk

2,948^th place

1,879^th place

1nobelprize.org

301^st place

478^th place

1sigcomm.org

low place

1informs.org

low place

9,066^th place

1worldcat.org

5^th place

1arxiv.org

69^th place

59^th place

1web.archive.org

1^st place

1dtic.mil

833^rd place

567^th place

1columbia.edu

488^th place

374^th place

1handle.net

102^nd place

76^th place

1illinois.edu

1,349^th place

866^th place

1siam.org

low place

6,473^rd place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Gusfield, Dan (1987). "Three fast algorithms for four problems in stable marriage". SIAM Journal on Computing. 16 (1): 111–128. doi:10.1137/0216010. MR 0873255.
Pittel, Boris (1989). "The average number of stable matchings". SIAM Journal on Discrete Mathematics. 2 (4): 530–549. doi:10.1137/0402048. MR 1018538.
Karlin, Anna R.; Gharan, Shayan Oveis; Weber, Robbie (2018). "A simply exponential upper bound on the maximum number of stable matchings". In Diakonikolas, Ilias; Kempe, David; Henzinger, Monika (eds.). Proceedings of the 50th Symposium on Theory of Computing (STOC 2018). Association for Computing Machinery. pp. 920–925. arXiv:1711.01032. doi:10.1145/3188745.3188848. ISBN 978-1-4503-5559-9. MR 3826305.
Irving, Robert W.; Leather, Paul (1986). "The complexity of counting stable marriages". SIAM Journal on Computing. 15 (3): 655–667. doi:10.1137/0215048. MR 0850415.
Dubins, L. E.; Freedman, D. A. (1981). "Machiavelli and the Gale–Shapley algorithm". American Mathematical Monthly. 88 (7): 485–494. doi:10.2307/2321753. JSTOR 2321753. MR 0628016.
Huang, Chien-Chung (2006). "Cheating by men in the Gale–Shapley stable matching algorithm". In Azar, Yossi; Erlebach, Thomas (eds.). Algorithms – ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11–13, 2006, Proceedings. Lecture Notes in Computer Science. Vol. 4168. Springer. pp. 418–431. doi:10.1007/11841036_39. ISBN 978-3-540-38875-3. MR 2347162.

arxiv.org (Global: 69^th place; English: 59^th place)

Karlin, Anna R.; Gharan, Shayan Oveis; Weber, Robbie (2018). "A simply exponential upper bound on the maximum number of stable matchings". In Diakonikolas, Ilias; Kempe, David; Henzinger, Monika (eds.). Proceedings of the 50th Symposium on Theory of Computing (STOC 2018). Association for Computing Machinery. pp. 920–925. arXiv:1711.01032. doi:10.1145/3188745.3188848. ISBN 978-1-4503-5559-9. MR 3826305.

columbia.edu (Global: 488^th place; English: 374^th place)

www1.cs.columbia.edu

Harry Mairson: "The Stable Marriage Problem", The Brandeis Review 12, 1992 (online).

doi.org (Global: 2^nd place; English: 2^nd place)

Bodin, Lawrence; Panken, Aaron (June 2003). "High Tech for a Higher Authority: The Placement of Graduating Rabbis from Hebrew Union College—Jewish Institute of Religion". Interfaces. 33 (3): 1–11. doi:10.1287/inte.33.3.1.16013. ISSN 0092-2102.
Gusfield, Dan (1987). "Three fast algorithms for four problems in stable marriage". SIAM Journal on Computing. 16 (1): 111–128. doi:10.1137/0216010. MR 0873255.
Pittel, Boris (1989). "The average number of stable matchings". SIAM Journal on Discrete Mathematics. 2 (4): 530–549. doi:10.1137/0402048. MR 1018538.
Karlin, Anna R.; Gharan, Shayan Oveis; Weber, Robbie (2018). "A simply exponential upper bound on the maximum number of stable matchings". In Diakonikolas, Ilias; Kempe, David; Henzinger, Monika (eds.). Proceedings of the 50th Symposium on Theory of Computing (STOC 2018). Association for Computing Machinery. pp. 920–925. arXiv:1711.01032. doi:10.1145/3188745.3188848. ISBN 978-1-4503-5559-9. MR 3826305.
Irving, Robert W.; Leather, Paul (1986). "The complexity of counting stable marriages". SIAM Journal on Computing. 15 (3): 655–667. doi:10.1137/0215048. MR 0850415.
Gale, D.; Shapley, L. S. (1962). "College Admissions and the Stability of Marriage". American Mathematical Monthly. 69 (1): 9–14. doi:10.2307/2312726. JSTOR 2312726. Archived from the original on September 25, 2017.
Iwama, Kazuo; Miyazaki, Shuichi (2008). "A Survey of the Stable Marriage Problem and Its Variants". International Conference on Informatics Education and Research for Knowledge-Circulating Society (ICKS 2008). IEEE. pp. 131–136. doi:10.1109/ICKS.2008.7. hdl:2433/226940. ISBN 978-0-7695-3128-1.
Dubins, L. E.; Freedman, D. A. (1981). "Machiavelli and the Gale–Shapley algorithm". American Mathematical Monthly. 88 (7): 485–494. doi:10.2307/2321753. JSTOR 2321753. MR 0628016.
Huang, Chien-Chung (2006). "Cheating by men in the Gale–Shapley stable matching algorithm". In Azar, Yossi; Erlebach, Thomas (eds.). Algorithms – ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11–13, 2006, Proceedings. Lecture Notes in Computer Science. Vol. 4168. Springer. pp. 418–431. doi:10.1007/11841036_39. ISBN 978-3-540-38875-3. MR 2347162.
Hatfield, John William; Milgrom, Paul (2005). "Matching with Contracts". American Economic Review. 95 (4): 913–935. doi:10.1257/0002828054825466. JSTOR 4132699.
Crawford, Vincent; Knoer, Elsie Marie (1981). "Job Matching with Heterogeneous Firms and Workers". Econometrica. 49 (2): 437–450. doi:10.2307/1913320. JSTOR 1913320.

dtic.mil (Global: 833^rd place; English: 567^th place)

Gale, D.; Shapley, L. S. (1962). "College Admissions and the Stability of Marriage". American Mathematical Monthly. 69 (1): 9–14. doi:10.2307/2312726. JSTOR 2312726. Archived from the original on September 25, 2017.

gla.ac.uk (Global: 2,948^th place; English: 1,879^th place)

dcs.gla.ac.uk

Stable Matching Algorithms

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Iwama, Kazuo; Miyazaki, Shuichi (2008). "A Survey of the Stable Marriage Problem and Its Variants". International Conference on Informatics Education and Research for Knowledge-Circulating Society (ICKS 2008). IEEE. pp. 131–136. doi:10.1109/ICKS.2008.7. hdl:2433/226940. ISBN 978-0-7695-3128-1.

illinois.edu (Global: 1,349^th place; English: 866^th place)

jeffe.cs.illinois.edu

Erickson, Jeff (June 2019). "4.5 Stable matching" (PDF). Algorithms. University of Illinois. pp. 170–176. Retrieved 2023-12-19.

informs.org (Global: low place; English: 9,066^th place)

pubsonline.informs.org

Bodin, Lawrence; Panken, Aaron (June 2003). "High Tech for a Higher Authority: The Placement of Graduating Rabbis from Hebrew Union College—Jewish Institute of Religion". Interfaces. 33 (3): 1–11. doi:10.1287/inte.33.3.1.16013. ISSN 0092-2102.

jstor.org (Global: 26^th place; English: 20^th place)

Gale, D.; Shapley, L. S. (1962). "College Admissions and the Stability of Marriage". American Mathematical Monthly. 69 (1): 9–14. doi:10.2307/2312726. JSTOR 2312726. Archived from the original on September 25, 2017.
Dubins, L. E.; Freedman, D. A. (1981). "Machiavelli and the Gale–Shapley algorithm". American Mathematical Monthly. 88 (7): 485–494. doi:10.2307/2321753. JSTOR 2321753. MR 0628016.
Hatfield, John William; Milgrom, Paul (2005). "Matching with Contracts". American Economic Review. 95 (4): 913–935. doi:10.1257/0002828054825466. JSTOR 4132699.
Crawford, Vincent; Knoer, Elsie Marie (1981). "Job Matching with Heterogeneous Firms and Workers". Econometrica. 49 (2): 437–450. doi:10.2307/1913320. JSTOR 1913320.

nobelprize.org (Global: 301^st place; English: 478^th place)

"The Prize in Economic Sciences 2012". Nobelprize.org. Retrieved 2013-09-09.

princeton.edu (Global: 741^st place; English: 577^th place)

cs.princeton.edu

Kleinberg, Jon; Tardos, Éva (2005). "Algorithmn Design: 1. Stable Matching" (PDF). www.cs.princeton.edu. Pearson-Addison Wesley: Princeton University. Retrieved 26 April 2025.

siam.org (Global: low place; English: 6,473^rd place)

Robinson, Sara (April 2003). "Are Medical Students Meeting Their (Best Possible) Match?" (PDF). SIAM News (3): 36. Retrieved 2 January 2018.

sigcomm.org (Global: low place; English: low place)

Bruce Maggs and Ramesh Sitaraman (2015). "Algorithmic nuggets in content delivery" (PDF). ACM SIGCOMM Computer Communication Review. 45 (3).

stanford.edu (Global: 179^th place; English: 183^rd place)

web.stanford.edu

Goel, Ashish (21 January 2019). Ramseyer, Geo (ed.). "CS261 Winter 2018- 2019 Lecture 5: Gale-Shapley Algorith" (PDF). web.stanford.edu. Stanford University. Retrieved 26 April 2025.

ucsd.edu (Global: 1,933^rd place; English: 1,342^nd place)

mathweb.ucsd.edu

Tesler, G. (2020). "Ch. 5.9: Gale-Shapley Algorithm" (PDF). mathweb.ucsd.edu. University of California San Diego. Retrieved 26 April 2025.

web.archive.org (Global: 1^st place; English: 1^st place)

Gale, D.; Shapley, L. S. (1962). "College Admissions and the Stability of Marriage". American Mathematical Monthly. 69 (1): 9–14. doi:10.2307/2312726. JSTOR 2312726. Archived from the original on September 25, 2017.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Bodin, Lawrence; Panken, Aaron (June 2003). "High Tech for a Higher Authority: The Placement of Graduating Rabbis from Hebrew Union College—Jewish Institute of Religion". Interfaces. 33 (3): 1–11. doi:10.1287/inte.33.3.1.16013. ISSN 0092-2102.

Stable matching problem (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

columbia.edu (Global: 488th place; English: 374th place)

www1.cs.columbia.edu

doi.org (Global: 2nd place; English: 2nd place)

dtic.mil (Global: 833rd place; English: 567th place)

gla.ac.uk (Global: 2,948th place; English: 1,879th place)

dcs.gla.ac.uk

handle.net (Global: 102nd place; English: 76th place)

hdl.handle.net

illinois.edu (Global: 1,349th place; English: 866th place)

jeffe.cs.illinois.edu

informs.org (Global: low place; English: 9,066th place)

pubsonline.informs.org

jstor.org (Global: 26th place; English: 20th place)

nobelprize.org (Global: 301st place; English: 478th place)

princeton.edu (Global: 741st place; English: 577th place)

cs.princeton.edu

siam.org (Global: low place; English: 6,473rd place)

sigcomm.org (Global: low place; English: low place)

stanford.edu (Global: 179th place; English: 183rd place)

web.stanford.edu

ucsd.edu (Global: 1,933rd place; English: 1,342nd place)

mathweb.ucsd.edu

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

ams.org (Global: 451^st place; English: 277^th place)

arxiv.org (Global: 69^th place; English: 59^th place)

columbia.edu (Global: 488^th place; English: 374^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

dtic.mil (Global: 833^rd place; English: 567^th place)

gla.ac.uk (Global: 2,948^th place; English: 1,879^th place)

handle.net (Global: 102^nd place; English: 76^th place)

illinois.edu (Global: 1,349^th place; English: 866^th place)

informs.org (Global: low place; English: 9,066^th place)

jstor.org (Global: 26^th place; English: 20^th place)

nobelprize.org (Global: 301^st place; English: 478^th place)

princeton.edu (Global: 741^st place; English: 577^th place)

siam.org (Global: low place; English: 6,473^rd place)

stanford.edu (Global: 179^th place; English: 183^rd place)

ucsd.edu (Global: 1,933^rd place; English: 1,342^nd place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 5^th place; English: 5^th place)