Epistemic characterizations of iterated deletion of inferior strategy profiles in preference-based type spaces (Q361813): Difference between revisions

The author provides an epistemic characterization of an iterative deletion procedure proposed by \textit{R. Stalnaker} [Theory Decis. 37, No. 1, 49--73 (1994; Zbl 0805.90150)] that yields a solution concept for strategic-form games called ``strong rationalizability''. The iterative deletion procedure is called ``iterated deletion of inferior strategy profiles''. An epistemic characterization of the pure-strategy version of that solution concept was proposed by the reviewer [in: Logic and the foundations of game and decision theory (LOFT7). Revised papers presented at the 7th conference, Liverpool, UK, July 2006. Amsterdam: Amsterdam University Press. 59--86 (2008; Zbl 1279.91034)] in the context of qualitative Kripke frames. This paper, on the other hand, follows the event-based approach and considers type space models where each type is associated with a preference relation on the state space. Within this context the author provides an epistemic characterization of both the qualitative, pure-strategy version and the probabilistic version of the iterative deletion algorithm.