An algorithm for verifying double implementability in Nash and strong Nash equilibria
From MaRDI portal
Publication:5932220
DOI10.1016/S0165-4896(99)00057-8zbMath0978.91019MaRDI QIDQ5932220
Publication date: 1 February 2002
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Related Items
Computing the strong Nash equilibrium for Markov chains games, Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness
Cites Work
- Cores of effectivity functions and implementation theory
- Double implementation in Nash and strong Nash equilibria
- Implementation with coalition formation: A complete characterization
- Double implementation by a simple game form in the commons problem
- An algorithm for checking strong Nash implementability
- Implementation under strong equilibrium. A complete characterization
- Nash Implementation: A Full Characterization
- Realization and Nash Implementation: Two Aspects of Mechanism Design
- Strategy Space Reduction in Maskin's Theorem: Sufficient Conditions for Nash Implementation
- Implementation Via Nash Equilibria
- A Necessary and Sufficient Condition for Two-Person Nash Implementation
- On the necessary and sufficient conditions for Nash implementation
- Unnamed Item