Pages that link to "Item:Q5631116"
From MaRDI portal
The following pages link to Stable marriage assignment for unequal sets (Q5631116):
Displayed 45 items.
- Enrollment manipulations in school choice (Q268634) (← links)
- Optimal truncation in matching markets (Q485816) (← links)
- Decentralized job matching (Q532508) (← links)
- Incentive compatibility for the stable matching model with an entrance criterion (Q532764) (← links)
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences (Q637586) (← links)
- In search of advice for participants in matching markets which use the deferred-acceptance algorithm (Q705854) (← links)
- Smith and Rawls share a room: stability and medians (Q708883) (← links)
- A parallel algorithm to solve the stable marriage problem (Q798000) (← links)
- Finding all stable matchings with couples (Q908185) (← 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)
- The college admissions problem with lower and common quotas (Q986550) (← links)
- Stable marriages by coroutines (Q1050775) (← links)
- A probabilistic version of the stable marriage problem (Q1053597) (← links)
- Optimum allocation of places to students in a national university system (Q1059002) (← links)
- Worst-case choice for the stable marriage problem (Q1063004) (← links)
- The average performance of a parallel stable mariage algorithm (Q1123623) (← links)
- Two-sided matching with incomplete information about others' preferences (Q1191821) (← links)
- A tale of two mechanisms: Student placement (Q1283855) (← links)
- Vacancy chains and equilibration in senior-level labor markets (Q1371137) (← links)
- ``Timing is everything'' and marital bliss (Q1601455) (← links)
- Lone wolves in infinite, discrete matching markets (Q1651278) (← links)
- Strategy-proofness of worker-optimal matching with continuously transferable utility (Q1651280) (← links)
- Gender consistent resolving rules in marriage problems (Q1671327) (← links)
- Time horizons, lattice structures, and welfare in multi-period matching markets (Q1756324) (← links)
- On two kinds of manipulation for school choice problems (Q1762420) (← links)
- Stable matchings and preferences of couples (Q1772667) (← links)
- Courtship and linear programming (Q1805218) (← links)
- Paths to marriage stability (Q1902886) (← links)
- Canonical monotone decompositions of fractional stable matchings (Q1914090) (← links)
- Sisterhood in the Gale-Shapley matching algorithm (Q1953489) (← links)
- Substitutes and stability for matching with contracts (Q1958950) (← links)
- A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games (Q1959733) (← links)
- Absorbing sets in roommate problems (Q2436304) (← links)
- A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion (Q2482673) (← links)
- The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems (Q2482674) (← links)
- Deferred acceptance algorithms: history, theory, practice, and open questions (Q2482681) (← links)
- Incentives in decentralized random matching markets (Q2519489) (← links)
- STABLE SOLUTIONS ON MATCHING MODELS WITH QUOTA RESTRICTION (Q2883138) (← links)
- A new algorithm for stable assignments (Q3202138) (← links)
- EMPLOYMENT BY LOTTO REVISITED (Q3402027) (← links)
- The stability of marriage and university admissions—zero-one programming method (Q3806985) (← links)
- Polyhedral Aspects of Stable Marriage (Q5244861) (← links)
- Stable marriage assignment for unequal sets (Q5631116) (← links)
- An analysis of the stable marriage assignment algorithm (Q5661507) (← links)