The following pages link to Stable husbands (Q5750860):
Displaying 24 items.
- Tight Markov chains and random compositions (Q439877) (← links)
- Stability concepts in matching under distributional constraints (Q508390) (← links)
- Why do stable clearinghouses work so well? -- Small sets of stable matchings in typical environments, and the limits-on-manipulation theorem of Demange, Gale and Sotomayor (Q908186) (← links)
- On a random graph evolving by degrees (Q1047669) (← links)
- On random exchange-stable matchings (Q1642152) (← links)
- On random stable partitions (Q2002063) (← links)
- Bipartite choices (Q2105872) (← links)
- On the equivalence of two competing affirmative actions in school choice (Q2157898) (← 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)
- On sparsity of the solution to a random quadratic optimization problem (Q2227539) (← links)
- Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality? (Q2670933) (← links)
- The graphs of stably matchable pairs (Q2672447) (← links)
- The concentration of the maximum degree in the duplication-divergence models (Q2695307) (← links)
- Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs (Q2818275) (← links)
- On the Likely Number of Solutions for the Stable Marriage Problem (Q3557497) (← links)
- Expected coalescence time for a nonuniform allocation process (Q3603195) (← links)
- On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm (Q4289306) (← links)
- On Subgraph Sizes in Random Graphs (Q4291207) (← links)
- (Q4500692) (← links)
- Interview with Don Knuth (Q5093430) (← links)
- On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women (Q5219711) (← links)
- Almost all graphs with average degree 4 are 3-colorable (Q5917586) (← links)
- Coalitional stability in matching problems with externalities and random preferences (Q6188684) (← links)
