An analysis of the stable marriage assignment algorithm
From MaRDI portal
Publication:5661507
DOI10.1007/BF01932966zbMath0249.05006MaRDI QIDQ5661507
Publication date: 1972
Published in: BIT (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Algorithms in computer science (68W99)
Related Items (18)
On random exchange-stable matchings ⋮ On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm ⋮ The average performance of a parallel stable mariage algorithm ⋮ Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality? ⋮ Review of the theory of stable matchings and contract systems ⋮ On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences ⋮ The necessary and sufficient condition for the worst-case male optimal stable matching ⋮ One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ On the Likely Number of Solutions for the Stable Marriage Problem ⋮ A stable marriage requires communication ⋮ 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 ⋮ Approximation algorithms in combinatorial scientific computing ⋮ The losses from integration in matching markets can be large ⋮ A probabilistic version of the stable marriage problem ⋮ A parallel algorithm to solve the stable marriage problem
Cites Work
This page was built for publication: An analysis of the stable marriage assignment algorithm
