论文标题
最多$ 3.55^n $稳定比赛
At most $3.55^n$ stable matchings
论文作者
论文摘要
我们将上限提高了$ n $ Jobs和$ n $申请人之间最大稳定匹配的最大稳定匹配数，从$ 131072^n+O（1）$（1）$（1）$（1）$（1）$ 3.55^n+O（1）$。为了建立这种界限，我们陈述了一种易于应用的特定熵结合的新颖表述，并且在计算其他组合物体时可能具有独立的兴趣
We improve the upper bound for the maximum possible number of stable matchings among $n$ jobs and $n$ applicants from $131072^n+O(1)$ to $3.55^n+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
