Implementation in undominated strategies by bounded mechanisms: the Pareto correspondence and a generalization
From MaRDI portal
Publication:1729675
DOI10.1016/j.jet.2018.12.010zbMath1419.91275OpenAlexW2908947494MaRDI QIDQ1729675
Eve Ramaekers, Saptarshi Mukherjee, Arunava Sen, Nozomu Muto
Publication date: 28 February 2019
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jet.2018.12.010
Related Items
Implementation in undominated strategies with applications to auction design, public good provision and matching, Implementation in strong core by codes of rights, Designing rotation programs: limits and possibilities, Implementation in undominated strategies with partially honest agents, Self-implementation of social choice correspondences in Nash equilibrium
Cites Work
- Nash implementation with partially honest individuals
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Implementation in undominated strategies with partially honest agents
- Role of honesty in full implementation
- Undominated strategies and coordination in normalform games
- Implementation in Undominated Strategies: A Look at Bounded Mechanisms
- Manipulation of Voting Schemes: A General Result
- Manipulation of Schemes that Mix Voting with Chance
- Nash Equilibrium and Welfare Optimality
- Implementation in Weakly Undominated Strategies: Optimality of Second-Price Auction and Posted-Price Mechanism: Figure 1
- Game Theory and Mechanism Design
- An Introduction to the Theory of Mechanism Design
- Pure Strategy Dominance