Mixed Nash Implementation with Finite Mechanisms
14 Pages Posted: 22 Sep 2012
Date Written: September 2012
This paper studies full implementation problems in (pure and mixed) Nash equilibrium in finite environments. We restrict the designer to adoptfinite mechanisms, thus ruling out integer games. We provide a condition, top-D inclusiveness, that together with set-monotonicity is sufficient for mixed Nash implementation with finite mechanisms in separable environments. Top-D inclusiveness is an efficiency condition.
Keywords: Implementation, Maskin monotonicity, pure and mixed Nash equilibrium, set-monotonicity, social choice correspondence, finite mechanisms
JEL Classification: C72, D71
Suggested Citation: Suggested Citation