The following pages link to (Q2921653):
Displayed 22 items.
- Asymptotic existence of proportionally fair allocations (Q277310) (← links)
- College admissions with stable score-limits (Q302118) (← links)
- Improving schools through school choice: a market design approach (Q337801) (← links)
- Fictitious students creation incentives in school choice problems (Q403704) (← links)
- Optimal truncation in matching markets (Q485816) (← links)
- Stability concepts in matching under distributional constraints (Q508390) (← links)
- Large roommate problem with non-transferable random utility (Q508413) (← links)
- Truncation strategies in two-sided matching markets: theory and experiment (Q738938) (← links)
- Incentives in the probabilistic serial mechanism (Q848608) (← 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)
- Stable matching mechanisms are not obviously strategy-proof (Q1622367) (← links)
- The object allocation problem with random priorities (Q1651226) (← links)
- Matching in the large: an experimental study (Q1651242) (← links)
- Suboptimal behavior in strategy-proof mechanisms: evidence from the residency match (Q1651286) (← links)
- Recent studies of agent incentives in internet resource allocation and pricing (Q1728405) (← links)
- Sisterhood in the Gale-Shapley matching algorithm (Q1953489) (← links)
- Matching of like rank and the size of the core in the marriage problem (Q2345222) (← links)
- Efficient resource allocation under multi-unit demand (Q2437801) (← links)
- Deferred acceptance algorithms: history, theory, practice, and open questions (Q2482681) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
- Stability in Large Matching Markets with Complementarities (Q2931695) (← links)