On the necessary and sufficient conditions for Nash implementation

From MaRDI portal
Publication:5896619

DOI10.1007/BF00183044zbMath0734.90007OpenAlexW2033798470MaRDI QIDQ5896619

Tomas Sjöström

Publication date: 1991

Published in: Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00183044




Related Items

Subgame perfect implementation: a full characterizationDivide-and-permuteImplementation with coalition formation: A complete characterizationImplementation in generalized matching problemsImplementation in partial equilibriumNash implementation with lottery mechanismsA full characterization of Nash implementation with strategy space reductionOn Nash implementability in allotment economies under domain restrictions with indifferenceNash implementation via simple stochastic mechanisms: strategy space reductionReexamination of Maskin's theorem on Nash implementabilityA simple sufficient condition for strong implementationIrresolute mechanism design: a new path to possibilityThe weak core of simple games with ordinal preferences: Implementation in Nash equilibrium.Implementation without rationality assumptionsPartially-honest Nash implementation: a full characterizationIncentive compatibility and strategy-proofness of mechanisms of organizational behavior control: retrospective, state of the art, and prospects of theoretical researchNash implementation without no-veto powerOn the necessary and sufficient conditions for Nash implementationImplementation in mixed Nash equilibriumAn algorithm for verifying double implementability in Nash and strong Nash equilibriaImplementation of voting operatorsImplementation by self-relevant mechanismsNash implementation theory - a note on full characterizationsImplementation of solutions to the problem of fair division when preferences are single-peakedMaskin's theorem with limited veto powerTreading a fine line: (im)possibilities for Nash implementation with partially-honest individualsAn algorithm for checking strong Nash implementabilityTwo-agent collusion-proof implementation with correlation and arbitrageConstrained implementationInteractive implementationNash implementation and double implementation: Equivalence theoremsDouble implementation without no-veto-powerA new necessary condition for Nash implementationNash implementation in private good economies with single-plateaued preferences and in matching problemsImplementation by self-relevant mechanisms: Applications.