Pages that link to "Item:Q989977"
From MaRDI portal
The following pages link to An impossibility theorem for matching problems (Q989977):
Displaying 16 items.
- Counting combinatorial choice rules (Q876881) (← links)
- Impossibility of stable and nonbossy matching mechanisms (Q969481) (← links)
- An unfeasible matching problem (Q1182611) (← links)
- Impossibility results for choice correspondences (Q1277456) (← links)
- Can pre-arranged matches be avoided in two-sided matching markets? (Q1294009) (← links)
- Top dominance and the possibility of strategy-proof stable solutions to matching problems (Q1341500) (← links)
- Lone wolves in infinite, discrete matching markets (Q1651278) (← links)
- Strategy-proofness of worker-optimal matching with continuously transferable utility (Q1651280) (← links)
- Manipulation of optimal matchings via predonation of endowment (Q1887543) (← links)
- An alternative characterization of the deferred acceptance algorithm (Q1939517) (← links)
- Coalitional unanimity versus strategy-proofness in coalition formation problems (Q1939520) (← links)
- Compromises and rewards: stable and non-manipulable probabilistic matching (Q2002058) (← links)
- Incentives in landing slot problems (Q2359379) (← links)
- An incompatibility between recursive unanimity and strategy-proofness in two-sided matching problems (Q2452262) (← links)
- A necessary and sufficient condition for stable matching rules to be strategy-proof (Q2513288) (← links)
- Implementing matching rules by type pretension mechanisms (Q2569387) (← links)