Pages that link to "Item:Q2513288"
From MaRDI portal
The following pages link to A necessary and sufficient condition for stable matching rules to be strategy-proof (Q2513288):
Displaying 9 items.
- On stable and strategy-proof rules in matching markets with contracts (Q508382) (← links)
- An impossibility theorem for matching problems (Q989977) (← links)
- Top dominance and the possibility of strategy-proof stable solutions to matching problems (Q1341500) (← links)
- Strategy-proofness and efficiency for non-quasi-linear and common-tiered-object preferences: characterization of minimum price rule (Q1753294) (← links)
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching (Q2291153) (← links)
- Random assignments on preference domains with a tier structure (Q2338670) (← links)
- An incompatibility between recursive unanimity and strategy-proofness in two-sided matching problems (Q2452262) (← links)
- The stability of the equilibrium outcomes in the admission games induced by stable matching rules (Q2482680) (← links)
- Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition (Q4682746) (← links)
