Abstract
This paper provides a sufficient monotonicity condition for the solution of a rationalizability procedure to be independent of the order of elimination. The analysis unfolds in an abstract environment that applies to any game and elimination procedure. Monotonicity is satisfied by rationalizability procedures based on monotone belief operators, such as “directed” rationalizability, interim correlated rationalizability, or, in sequential games, initial and backwards rationalizability.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
