Information complexity, punishment, and stability in two Nash efficient Lindahl mechanisms
From MaRDI portal
Publication:427552
DOI10.1007/S10058-011-0112-4zbMATH Open1239.91071OpenAlexW2089326555MaRDI QIDQ427552FDOQ427552
Publication date: 13 June 2012
Published in: Review of Economic Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10058-011-0112-4
Recommendations
- Out-of-equilibrium performance of three Lindahl mechanisms: experimental evidence
- Stability of the Groves and Ledyard mechanism
- Learning dynamics for mechanism design: an experimental comparison of public goods mechanisms
- Nash implementation of Lindahl allocations
- Stable implementation of Lindahl allocations
Auctions, bargaining, bidding and selling, and other market models (91B26) Experimental studies (91A90)
Cites Work
- Title not available (Why is that?)
- Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities
- A Simple Incentive Compatible Scheme for Attaining Lindahl Allocations
- Outcome Functions Yielding Walrasian and Lindahl Allocations at Nash Equilibrium Points
- Title not available (Why is that?)
- Adaptive expectations and dynamic adjustment in noncooperative games with incomplete information
- A family of supermodular Nash mechanisms implementing Lindahl allocations
- A note on the stability of Chen's Lindahl mechanism
- Out-of-equilibrium performance of three Lindahl mechanisms: experimental evidence
- A stable Nash mechanism implementing Lindahl allocations for quasi-linear environments
- Implementation of Lindahl equilibrium: An integration of the static and dynamic approaches
- Learning dynamics for mechanism design: an experimental comparison of public goods mechanisms
- Stable implementation of Lindahl allocations
Cited In (3)
This page was built for publication: Information complexity, punishment, and stability in two Nash efficient Lindahl mechanisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427552)