Compellingness in Nash implementation
From MaRDI portal
Cites work
- A crash course in implementation theory
- A Necessary and Sufficient Condition for Two-Person Nash Implementation
- Complexity and repeated implementation
- Conventions under heterogeneous behavioural rules
- Cooperation and bounded recall
- Exact implementation
- Generalized risk-dominance and asymmetric dynamics
- scientific article; zbMATH DE number 47120 (Why is no real title available?)
- Implementation in mixed Nash equilibrium
- Implementation in Undominated Strategies: A Look at Bounded Mechanisms
- Implementation with Near-Complete Information
- Learning, Mutation, and Long Run Equilibria in Games
- Maskin meets Abreu and Matsushima
- Mixed Bayesian implementation in general environments
- Multiplicity of mixed equilibria in mechanisms: a unified approach to exact and approximate implementation
- Nash Equilibrium and Welfare Optimality
- Nash Implementation: A Full Characterization
- On the Strategic Stability of Equilibria
- Rationalizable implementation
- Rationalizable implementation in finite mechanisms
- Rationalizable implementation of correspondences
- Rationalizable implementation of social choice correspondences
- Rationalizable implementation of social choice functions: Complete characterization
- Sequential commitment games
- Subgame Perfect Implementation
- Subgame-perfect implementation under information perturbations
- The Evolution of Conventions
- The Theory of Implementation of Social Choice Rules
- Undominated Nash implementation in bounded mechanisms
- Virtual Implementation in Iteratively Undominated Strategies: Complete Information
This page was built for publication: Compellingness in Nash implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7297053)