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)
05A15: Exact enumeration problems, generating functions
05A05: Permutations, words, matrices
68W99: Algorithms in computer science
Related Items
On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm, On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women, Approximation algorithms in combinatorial scientific computing, Review of the theory of stable matchings and contract systems, Marriage matching and gender satisfaction, A parallel algorithm to solve the stable marriage problem, The necessary and sufficient condition for the worst-case male optimal stable matching, A probabilistic version of the stable marriage problem, The average performance of a parallel stable mariage algorithm, On random exchange-stable matchings, Social integration in two-sided matching markets, On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences, 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, A stable marriage requires communication, The losses from integration in matching markets can be large, Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality?, On the Likely Number of Solutions for the Stable Marriage Problem
Cites Work
