




Random Stable Matchings
Abstract
The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting constraints. A stable matching is a pairing of adjacent vertices in a graph such that no unpaired vertices prefer each other to their partners under the matching. The problem of finding stable matchings is known as stable marriage problem (on bipartite graphs) or as stable roommates problem (on the complete graph). It is wellknown that not all instances on nonbipartite graphs admit a stable matching. Here we present numerical results for the probability that a graph with n vertices and random preference relations admits a stable matching. In particular we find that this probability decays algebraically on graphs with connectivity $\Theta(n)$ and exponentially on regular grids. On finite connectivity ErdösRényi graphs the probability converges to a value larger than zero. Based on the numerical results and some heuristic reasoning we formulate five conjectures on the asymptotic properties of random stable matchings.
BiBTeX Entry
@article{, author = {Stephan Mertens}, title = {Random Stable Matchings}, journal = {J. Stat. Mech.: Theor. Exp.}, year = {2005}, pages = {P10008}, note = {\url{http://arxiv.org/abs/condmat/0509221}} }
Download:
Matchings.pdf (pdf, 590 kB)





© by Stephan Mertens
URL: http://
updated on Wednesday, October 12th 2005, 09:53:09 CET;