The reasoning-based expected utility procedure

This paper presents a new iterative procedure for solving finite non-cooperative games, the reasoning-based expected utility procedure (RBEU), and compares this with existing iterative procedures. RBEU deletes more strategies than iterated deletion of strictly dominated strategies, while avoiding the conceptual problems associated with iterated deletion of weakly dominated strategies. It uses a sequence of “accumulation” and “deletion” operations to categorise strategies as permissible and impermissible; strategies may remain uncategorised when the procedure halts. RBEU and related “categorisation procedures” can be interpreted as tracking successive steps in players' own reasoning.