Abstract:Two sets of objects of size $n$ are to be matched to each other based on i.i.d.\ costs associated to every pair of objects. Objects prefer to be matched as cheaply as possible, and a matching is said to be stable if there is no pair of objects that would prefer to match to each other rather than to their current partners. Properties of such matchings are analysed for cost distributions with a density $\rho$ satisfying $\rho(x)/(dx^{d-1})\to 1$ as $x\to 0^+$, where the number $d$ is known as the pseudo-dimension. For $d>0$, the typical matching cost is shown to be of order $n^{-1/d}$, with an explicit distributional limit. For $d>1$ the total matching cost is shown to be of order $n^{1-1/d}$, and to obey a law of large numbers. For $d> 2$, the fluctuations of the total matching cost are shown to be of order $n^{1/2-1/d}$, and to obey a central limit theorem. In contrast, for $1<d<2$ fluctuations are non-Gaussian and of constant order, whereas at the critical value $d=2$ fluctuations are shown to be order $\sqrt{\log n}$ and occasionally of Gaussian nature.
From: Tiffany Y. Y. Lo [view email]
[v1]
Sun, 26 Oct 2025 14:49:16 UTC (127 KB)
[v2]
Fri, 11 Sep 2026 11:48:47 UTC (135 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。