The Average Number of Stable Matchings
From MaRDI portal
Publication:3353030
DOI10.1137/0402048zbMath0729.05004OpenAlexW1991220215MaRDI QIDQ3353030
Publication date: 1989
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0402048
Central limit and other weak theorems (60F05) Permutations, words, matrices (05A05) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (34)
Measuring the instability in two-sided matching procedures ⋮ Instability in stable marriage problem: matching unequally numbered men and women ⋮ Two-sided matching markets with strongly correlated preferences ⋮ On random exchange-stable matchings ⋮ On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm ⋮ On the connected components of a random permutation graph with a given number of edges ⋮ Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality? ⋮ Disjoint stable matchings in linear time ⋮ Assigning more students to their top choices: a comparison of tie-breaking rules ⋮ Review of the theory of stable matchings and contract systems ⋮ On Bollobás‐Riordan random pairing model of preferential attachment graph ⋮ Inefficiency of random serial dictatorship under incomplete information ⋮ Minimal instances with no weakly stable matching for three-sided problem with cyclic incomplete preferences ⋮ On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences ⋮ The cost of strategy-proofness in school choice ⋮ Stability in repeated matching markets ⋮ Coalitional stability in matching problems with externalities and random preferences ⋮ On random quadratic forms: supports of potential local maxima ⋮ What price stability? Social welfare in matching markets ⋮ What matters in school choice tie-breaking? How competition guides design ⋮ One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences ⋮ Optimal truncation in matching markets ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ On the Likely Number of Solutions for the Stable Marriage Problem ⋮ Large roommate problem with non-transferable random utility ⋮ Matching with externalities: the role of prudence and social connectedness in stability ⋮ On random stable partitions ⋮ Instability of matchings in decentralized markets with various preference structures ⋮ Marriage matching and gender satisfaction ⋮ Social integration in two-sided matching markets ⋮ On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women ⋮ The losses from integration in matching markets can be large ⋮ Matching of like rank and the size of the core in the marriage problem ⋮ Ex-ante welfare superiority of the Boston mechanism over the deferred acceptance mechanism
This page was built for publication: The Average Number of Stable Matchings
