Order Independence for Rationalizability

This paper provides a sufficient monotonicity condition for the solution of a rationalizability procedure to be independent from the order of elimination. The analysis unfolds in an abstract environment that applies to any form of finite game and elimination procedure. The result applies to rationalizability procedures with monotone belief operators, such as "directed" rationalizability, interim correlated rationalizability and, in sequential games, initial and backwards rationalizability