@inproceedings{4343679a6b7e483793085e15fff6b1db,
title = "At most 3.55nstable matchings",
abstract = "We improve the upper bound for the maximum possible number of stable matchings among n jobs and n applicants from 131072n+ O(1) to 3.55n+ O(1). To establish this bound, we state a novel formulation of a certain entropy bound that is easy to apply and may be of independent interest in counting other combinatorial objects.",
keywords = "entropy, stable matchings",
author = "Cory Palmer and Domotor Palvolgyi",
note = "Publisher Copyright: {\textcopyright} 2022 IEEE.; 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021 ; Conference date: 07-02-2022 Through 10-02-2022",
year = "2022",
doi = "10.1109/FOCS52979.2021.00029",
language = "English",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "217--227",
booktitle = "Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021",
}