Abstract

We introduce possibilistic beliefs into strategic games, describing a player’s belief about his opponents’ strategies as the set of their strategies he regards as possible. We formulate possibilistic strategic games where each player has preferences over his own strategies conditional on his possibilistic belief about his opponents’ strategies. We define several solution concepts for possibilistic strategic games such as (strict) equilibria, rationalizable sets, iterated elimination of never-best responses, and iterated elimination of strictly dominated strategies, and we study their properties and relationships. We develop a class of possibilistic strategic games called possibilistic supermodular games to relate supermodular games to possibilistic strategic games. Lastly, we discuss a direction of extending our possibilistic framework to games with incomplete information.