Pages that link to "Item:Q5661507"
From MaRDI portal
The following pages link to An analysis of the stable marriage assignment algorithm (Q5661507):
Displayed 18 items.
- Marriage matching and gender satisfaction (Q733764) (← links)
- A parallel algorithm to solve the stable marriage problem (Q798000) (← links)
- The necessary and sufficient condition for the worst-case male optimal stable matching (Q915462) (← links)
- A probabilistic version of the stable marriage problem (Q1053597) (← links)
- The average performance of a parallel stable mariage algorithm (Q1123623) (← links)
- On random exchange-stable matchings (Q1642152) (← links)
- Social integration in two-sided matching markets (Q1800976) (← links)
- On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences (Q2197901) (← links)
- One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences (Q2223683) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- A stable marriage requires communication (Q2278950) (← links)
- The losses from integration in matching markets can be large (Q2328512) (← links)
- Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality? (Q2670933) (← links)
- On the Likely Number of Solutions for the Stable Marriage Problem (Q3557497) (← links)
- On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm (Q4289306) (← links)
- On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women (Q5219711) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)