A simply exponential upper bound on the maximum number of stable matchings
Work
Year: 2018
Type: article
Abstract: Stable matching is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley. In this... more
Institution University of Washington
Cites: 20
Cited by: 21
Related to: 10
FWCI: 11.28
Citation percentile (by year/subfield): 98.56
Subfield: Economics and Econometrics
Domain: Social Sciences
Sustainable Development Goal Gender equality
Open Access status: bronze
Grant IDS CCF-1552097, CCF-1420381, YIP N00014-17-1-2429