Implementation with Near-Complete Information
From MaRDI portal
Recommendations
- Recent Results on Implementation with Complete Information
- Robust virtual implementation with almost complete information
- scientific article; zbMATH DE number 1054714
- Continuous virtual implementation: complete information
- Implementation with partial verification
- Extensive form implementation in incomplete information environments
- Virtual Implementation in Iteratively Undominated Strategies: Complete Information
- Implementation with partial provability
- Implementing imprecision in information systems
Cited in
(21)- Designing referenda: an economist's pessimistic perspective
- Robust refinement of rationalizability with arbitrary payoff uncertainty
- Direct implementation with evidence
- Implementation with evidence
- Implementation in adaptive better-response dynamics: towards a general theory of bounded rationality in mechanisms
- Robust implementation with costly information
- Continuous implementation with direct revelation mechanisms
- Continuous level-k mechanism design
- Direct implementation with minimally honest individuals
- Maskin meets Abreu and Matsushima
- Mechanism design when players' preferences and information coincide
- Robust equilibrium outcomes in sequential games under almost common certainty of payoffs
- Locally robust contracts for moral hazard
- Continuous virtual implementation: complete information
- Mechanism design with possibilistic beliefs
- Implementation with a sympathizer
- A new approach to the implementation problem
- Robust virtual implementation with almost complete information
- Implementation in Dominant Strategies under Complete and Incomplete Information
- Simple mechanisms and preferences for honesty
- Recent Results on Implementation with Complete Information
This page was built for publication: Implementation with Near-Complete Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5472971)
