Return
Monotonicity and Robust Implementation Under Forward-Induction Reasoning
DOI:10.3982/ECTA23709.png)
Abstract
En 中文
In sequential games, the set of paths consistent with rationality and forward-induction reasoning may change nonmonotonically when adding transparent restrictions on players' beliefs. Yet, we prove that—in an incomplete-information environment—predictions become sharper when the restrictions only concern initial beliefs about types. Thus, strong rationalizability for games with payoff uncertainty characterizes the path predictions of forward-induction reasoning across all possible restrictions on players' hierarchies of exogenous beliefs. With this, we can solve an open problem: the implementation of social choice functions through sequential mechanisms under forward-induction reasoning—which considerably expands the realm of implementable functions compared with simultaneous mechanisms (Müller (2016))—is indeed robust in the sense of Bergemann and Morris (2009).
Keywords:
Incomplete information
forward induction
strong rationalizability
path monotonicity
robust implementation
sequential mechanisms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
3.0K
Citations:
4.3W
Organization
Cited Papers
VIRTUAL IMPLEMENTATION IN ITERATIVELY UNDOMINATED STRATEGIES - COMPLETE INFORMATION
ECONOMETRICA
IF7.1

