alpha- robust equilibrium in anonymous games
share
In this paper, we consider the notion of α- robust equilibrium for finite strategic players in anonymous games, where utility of a player depends on other players' actions only through the resulting distribution of actions played. This equilibrium is defined as the set of strategies of the players such that no user wants to deviate as long as N-α-1 number are playing the equilibrium strategies. We provide sufficient conditions for the existence of this equilibrium. In addition, we prove a part of Berge's Maximal Theorem for correspondences.
READ FULL TEXT