Pages that link to "Item:Q1622367"
From MaRDI portal
The following pages link to Stable matching mechanisms are not obviously strategy-proof (Q1622367):
Displaying 29 items.
- Application fee manipulations in matching markets (Q393269) (← links)
- Group robust stability in matching markets (Q665110) (← links)
- Automated optimal OSP mechanisms for set systems. The case of small domains (Q777956) (← 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)
- Suboptimal behavior in strategy-proof mechanisms: evidence from the residency match (Q1651286) (← links)
- Communication with evidence in the lab (Q1756334) (← links)
- Protective behavior in matching models (Q1804637) (← links)
- Two-sided strategy-proofness in many-to-many matching markets (Q2021788) (← links)
- Level-k reasoning in school choice (Q2031184) (← links)
- An improved bound to manipulation in large stable matches (Q2049465) (← links)
- Stability of equilibrium outcomes under deferred acceptance: acyclicity and dropping strategies (Q2098899) (← links)
- On obviously strategy-proof implementation of fixed priority top trading cycles with outside options (Q2126158) (← links)
- Obvious strategyproofness, bounded rationality and approximation (Q2147998) (← links)
- Impossibility of weakly stable and strategy-proof mechanism (Q2159837) (← links)
- A revelation principle for obviously strategy-proof implementation (Q2212777) (← links)
- Untruthful dominant strategies for the deferred acceptance algorithm (Q2275655) (← links)
- A stable marriage requires communication (Q2278950) (← links)
- Obvious manipulations (Q2288530) (← links)
- On obvious strategy-proofness and single-peakedness (Q2295829) (← links)
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
- Menu mechanisms (Q2675411) (← links)
- The iterative deferred acceptance mechanism (Q2675461) (← links)
- Loss aversion in strategy-proof school-choice mechanisms (Q2682797) (← links)
- OBVIOUSLY STRATEGY‐PROOF IMPLEMENTATION OF TOP TRADING CYCLES (Q3299199) (← links)
- Stability, Strategy-Proofness, and Cumulative Offer Mechanisms (Q5049108) (← links)
- Obviously Strategyproof Mechanisms for Machine Scheduling. (Q5075789) (← links)
- All sequential allotment rules are obviously strategy‐proof (Q6076917) (← links)
- Object reallocation problems with single-dipped preferences (Q6102576) (← links)
- A theory of simplicity in games and mechanism design (Q6536583) (← links)
