A robustness result for rationalizable implementation
From MaRDI portal
Publication:536103
Recommendations
Cites work
- scientific article; zbMATH DE number 4207454 (Why is no real title available?)
- A Structure Theorem for Rationalizability with Application to Robust Predictions of Refinements
- Formulation of Bayesian analysis for games with incomplete information
- Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
- Robust Mechanism Design
- Robust implementation in direct mechanisms
- Robust virtual implementation: toward a reinterpretation of the Wilson doctrine
Cited in
(10)- Bounded depths of rationality and implementation with complete information
- Continuous level-\(k\) mechanism design
- An alternative equivalent formulation for robust implementation
- Efficient rational proofs with strong utility-gap guarantees
- An institution-independent proof of the Robinson consistency theorem
- Rationalizable implementation of correspondences
- Robust implementation in general mechanisms
- scientific article; zbMATH DE number 7070744 (Why is no real title available?)
- Interim rationalizable implementation of functions
- Robust virtual implementation under common strong belief in rationality
This page was built for publication: A robustness result for rationalizable implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536103)