Subgame perfect implementation: a full characterization
From MaRDI portal
Publication:2370493
DOI10.1016/j.jet.2005.06.008zbMath1280.91061OpenAlexW2068693303MaRDI QIDQ2370493
Publication date: 26 June 2007
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jet.2005.06.008
Related Items
Virtual Nash implementation with admissible support ⋮ Subgame perfect implementation of voting rules via randomized mechanisms ⋮ Random extensive form games ⋮ One-step-ahead implementation ⋮ Subgame-perfect implementation of bargaining solutions: comment ⋮ Irresolute mechanism design: a new path to possibility ⋮ Privacy in implementation ⋮ Partially-honest Nash implementation: a full characterization ⋮ Robust implementation in weakly perfect Bayesian strategies ⋮ Repeated implementation with overlapping generations of agents ⋮ On the subgame perfect implementability of voting rules ⋮ Do coalitions matter in designing institutions? ⋮ Efficient and stable collective choices under gregarious preferences
Cites Work
- Unnamed Item
- Subgame perfect implementation: A necessary and almost sufficient condition
- Implementation via backward induction
- Extensive form implementation in incomplete information environments
- Implementation with extensive form games: one round of signaling is not enough
- Virtual implementation in backwards induction
- Perfect Bayesian implementation
- Sophisticated voting rules: The case of two tournaments
- Handbook of social choice and welfare. Vol. 1.
- A crash course in implementation theory
- Nash Implementation: A Full Characterization
- Virtual Implementation in Nash Equilibrium
- Subgame Perfect Implementation
- Dominance Solvable Voting Schemes
- Virtual Implementation in Iteratively Undominated Strategies: Complete Information
- Implementation in Undominated Strategies: A Look at Bounded Mechanisms
- Nash Equilibrium and Welfare Optimality
- A Necessary and Sufficient Condition for Two-Person Nash Implementation
- On the necessary and sufficient conditions for Nash implementation