In games with incomplete information, conventional hierarchies of belief are incomplete as descriptions of the players' information for the purposes of determining a player's behavior. We show by example that this is true for a variety of solution concepts. We then investigate what is essential...

We define generalized extensive-form games which allow for mutual unawareness of actions. We extend Pearce's (1984) notion of extensive-form (correlated) rationalizability to this setting, explore its properties and prove existence. We define also a new variant of this solution concept, prudent...

This paper studies a noncooperative allocation procedure for coalitional games with veto players. The procedure is similar to the one presented by Dagan et al. (1997) for bankruptcy problems. According to it, a player, the proposer, makes a proposal that the remaining players must accept or...

We characterize strategy sets that are closed under rational behavior (curb) in extensive games of perfect information and finite horizon. It is shown that any such game possesses only one minimal curb set, which necessarily includes all its subgame perfect Nash equilibria. Applications of this...

This paper builds on one of the results of Pruzhansky [22], namely that maximin strategies guarantee the same expected payoffs as mixed Nash equilibrium strategies in bimatrix games. We present a discussion on the applicability of maximin strategies in such class of games. The usefulness of...

We fuse a social dilemma game and a game pitting the group against nature, where the group's probability of avoiding disaster depends on the resources it raises from members. The result is the Nederlander-Prisoner's Dilemma Game where the cost of failure is equally shared. We introduce the...

In modern elections, ideologically motivated candidates with a wealth of information about individual voters and sophisticated campaign strategies are faced by voters who lack awareness of some political issues and are uncertain about the exact political positions of candidates. We study to what...