An analysis of the stable marriage assignment algorithm
From MaRDI portal
Cites work
Cited in
(24)- 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
- 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
- School choice with independent versus consolidated districts
- On constrained matchings, stable under random preferences
- A direct proof of the short-side advantage in random matching markets
- Tiered random matching markets: rank is proportional to popularity
- The distribution of envy in matching markets
- Welfare effects of integrating unbalanced matching markets
- 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
This page was built for publication: An analysis of the stable marriage assignment algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5661507)