Rational Dynamics and Epistemic Logic in Games
Johan van Benthem

Abstract:
Game-theoretic solution concepts describe sets of strategy profiles
that are optimal for all players in some plausible sense. Such sets
are often found by recursive algorithms like iterated removal of
strictly dominated strategies in strategic games, or backward
induction in extensive games. Standard logical analyses of solution
sets use assumptions about players in fixed epistemic models for a
given game, such as mutual knowledge of rationality. In this paper, we
propose a different perspective, analyzing solution algorithms as
processes of learning which change game models. Thus, strategic
equilibrium gets linked to fixed-points of operations of repeated
announcement of suitable epistemic statements. This dynamic stance
provides a new look at the current interface of games, logic, and
computation.

Keywords: strategic game, epistemic model, update, 
iteration, fixed-point logic