Random stable matchings

DOI10.1088/1742-5468/2005/10/P10008zbMath1456.91065arXivcond-mat/0509221MaRDI QIDQ4968805

Stephan Mertens

Publication date: 9 July 2019

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0509221

zbMATH Keywords

networksrandom graphsinteracting agent modelsapplications to game theory and mathematical economics

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Matching models (91B68)

Related Items (9)

On random exchange-stable matchings ⋮ An extendable stable matching algorithm of a kind of bipartite graph ⋮ Coalitional stability in matching problems with externalities and random preferences ⋮ One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences ⋮ A General Framework for Stable Roommates Problems using Answer Set Programming ⋮ Stable roommates problem with random preferences ⋮ Small random instances of the stable roommates problem ⋮ Coalescence on the real line ⋮ On random stable partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The ``stable roommates problem with random preferences
• A characterization of graphs that ensure the existence of stable matchings
• A necessary and sufficient condition for the existence of a complete stable matching
• An efficient algorithm for the “stable roommates” problem
• On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm
• An upper bound for the solvability probability of a random stable roommates instance
• College Admissions and the Stability of Marriage
• Beauty and distance in the stable marriage problem

This page was built for publication: Random stable matchings