Locally robust implementation and its limits

DOI10.1016/j.jet.2012.05.012zbMath1276.91080OpenAlexW2132105654MaRDI QIDQ694745

Benny Moldovanu, Moritz Meyer-ter-Vehn, Philippe Jehiel

Publication date: 13 December 2012

Published in: Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jet.2012.05.012

zbMATH Keywords

ex-post implementationbilinear value functionlocally robust implementationquasi-linear Bernoulli utility functionregular allocation function

Mathematics Subject Classification ID

Economics of information (91B44) Individual preferences (91B08) Special types of economic markets (including Cournot, Bertrand) (91B54) Social choice (91B14) Heterogeneous agent models (91B69)

Related Items (6)

Continuous implementation with direct revelation mechanisms ⋮ Continuous virtual implementation: complete information ⋮ Locally robust contracts for moral hazard ⋮ Continuous level-\(k\) mechanism design ⋮ Continuous implementation with payoff knowledge ⋮ Uncertainty and robustness of surplus extraction

Cites Work

• The robustness of robust implementation
• Ex-post implementation and preference aggregation via potentials
• A necessary and sufficient condition for rationalizability in a quasilinear context
• Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
• Incentive compatibility and incomplete information
• Multidimensional mechanism design for auctions with externalities
• The relevance of private information in mechanism design
• Continuous Implementation
• Efficiency Despite Mutually Payoff-Relevant Private Information: The Finite Case
• The Limits of ex post Implementation
• Robust Implementation in Direct Mechanisms
• Full Extraction of the Surplus in Bayesian and Dominant Strategy Auctions
• Incentives in Teams
• Manipulation of Voting Schemes: A General Result
• Efficient Auctions
• Efficient Design with Interdependent Valuations
• Robust Mechanism Design
• Envelope Theorems for Arbitrary Choice Sets
• Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model

This page was built for publication: Locally robust implementation and its limits