Fall Back Equilibrium

Fall back equilibrium is a refinement of the Nash equilibrium concept. In the underly- ing thought experiment each player faces the possibility that, after all players decided on their action, his chosen action turns out to be blocked. Therefore, each player has to decide beforehand on a back-up action, which he plays in case he is unable to play his primary action. In this paper we introduce the concept of fall back equilibrium and show that the set of fall back equilibria is a non-empty and closed subset of the set of Nash equilibria. We discuss the relations with other equilibrium concepts, and among other results it is shown that each robust equilibrium is fall back and for bimatrix games also each proper equilibrium is a fall back equilibrium. Furthermore, we show that for bimatrix games the set of fall back equilibria is the union of finitely many polytopes, and that the notions of fall back equilibrium and strictly fall back equilibrium coincide. Finally, we allow multiple actions to be blocked, resulting in the notion of complete fall back equilibrium. We show that the set of complete fall back equilibria is a non-empty and closed subset of the set of proper equilibria.