Anna R. Karlin, Shayan Oveis Gharan, Robbie Weber. A simply exponential upper bound on the maximum number of stable matchings. In Ilias Diakonikolas, David Kempe 0001, Monika Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. pages 920-925, ACM, 2018. [doi]
Abstract is missing.