Implementation in undominated Nash equilibria without integer games
From MaRDI portal
(Redirected from Publication:1324092)
Recommendations
- Nash Implementation Using Undominated Strategies
- Undominated Nash implementation in bounded mechanisms
- Implementation Via Nash Equilibria
- Undominated Nash implementation with collusion and renegotiation
- Double implementation in Nash and undominated Nash equilibria
- Implementation of Nash bargaining solutions with non-convexity
- Nash equilibria in N-person games without convexity
- Implementation in stochastic dominance Nash equilibria
- Nash-implementation of competitive equilibria via a bounded mechanism
- Nash Implementation: A Full Characterization
Cited in
(25)- A natural mechanism for eliciting rankings when jurors have favorites
- Bounded depths of rationality and implementation with complete information
- Dominant strategy implementation in economic environments
- A simple and procedurally fair game form for Nash implementation of the No-envy solution
- Partially-honest Nash implementation: a full characterization
- Implementing optimal scholarship assignments via backward induction
- Nash implementation with partially honest individuals
- On implementation via demand commitment games
- Adaptive dynamics and the implementation problem with complete information
- Implementing the core of a two-person pure allocation game without free disposal or integer games
- Maskin meets Abreu and Matsushima
- Complexity and repeated implementation
- Outcome-robust mechanisms for Nash implementation
- The pivotal mechanism versus the voluntary contribution mechanism: an experimental comparison
- Implementation in Undominated Strategies: A Look at Bounded Mechanisms
- Implementation theory
- Simple mechanisms and preferences for honesty
- Implementation in principal-agent models of adverse selection
- Implementing coordinated team play
- Implementation in adaptive better-response dynamics: towards a general theory of bounded rationality in mechanisms
- Generalized average rules as stable Nash mechanisms to implement generalized median rules
- Subgame-perfect implementation of bargaining solutions.
- Undominated Nash implementation with collusion and renegotiation
- Implementation in minimax regret equilibrium
- Nash-implementation of competitive equilibria via a bounded mechanism
This page was built for publication: Implementation in undominated Nash equilibria without integer games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1324092)