In classic game theory, agents use mixed strategies in the form of objective and probabilistically precise devices to conceal their actions. We introduce the larger set of probabilistically imprecise devices as strategies and study the consequences for the basic results of normal form games....

This paper presents a class of finite n x n bimatrix (2-player) games we coin Circulant Games. In Circulant Games, each player's payoff matrix is a circulant matrix, i.e.\ each row vector is rotated one element relative to the preceding row vector. We show that when the payoffs in the first row...

We define a generalized state-space model with interactive unawareness and probabilistic beliefs. Such models are desirable for many potential applications of asymmetric unawareness. We develop Bayesian games with unawareness, define equilibrium, and prove existence. We show how equilibria are...

Heifetz, Meier and Schipper (2005) introduced a generalized state-space model that allows for non-trivial unawareness among several individuals and strong properties of knowledge. We show that this generalized state-space model arises naturally if states consist of maximally consistent sets of...

The standard state-spaces of asymmetric information preclude non-trivial forms of unawareness (Modica and Rustichini, 1994, Dekel, Lipman and Rustichini, 1998). We introduce a generalized state-space model that allows for non-trivial unawareness among several individuals, and which satisfies...

Bergin and Lipman (1996) show that the refinement effect from the random mutations in the adaptive population dynamics in Kandori, Mailath and rob (1993) and Young (1993) is due to restrictions on how these mutation rates vary across population states. We here model mutation rates as...

Bergin and Lipman (1996) show that the refinement effect from the random mutations in the adaptive dynamics in Kandori, Mailath and Rob (1993) and Young (1993) is due to restrictions on how these mutation rates vary across population states. We here model these mutation rates as endogenously...

This paper provides deterministic approximation results for stochastic processes that arise when finite populations recurrently play finite games. The deterministic approximation is defined in continuous time as a system of ordinary differential equations of the type studied in evolutionary game...

Evolutionary game theory studies the robustness of strategy profiles and sets of strategy profiles with respect to evolutionary forces in games played repeatedly in large populations of boundedly rational agents. The approach is macro oriented in the sense of focusing on the strategy...

The standard framework for analyzing games with incomplete information models players as if they have an infinite depth of reasoning, which is not always consistent with experimental evidence. This paper generalizes the type spaces of Harsanyi (1967-1968) so that players can have a finite depth...