Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3643
Articles: 2'487'895
Articles rated: 2609

28 March 2024
 
  » arxiv » cond-mat/0509221

 Article overview


Random Stable Matchings
Stephan Mertens ;
Date 8 Sep 2005
Journal J. Stat. Mech. (2005) P100008 DOI: 10.1088/1742-5468/2005/10/P10008
AbstractThe 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 well-known that not all instances on non-bipartite 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ös-Ré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.
Source arXiv, cond-mat/0509221
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser claudebot






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica