We generalize the "No-speculative-trade" theorem for finite unawareness belief structures in Heifetz, Meier, and Schipper (2013) to the infinite case.

We correlate competitive bidding and profits in symmetric independent private value first-price auctions with salivary testosterone, estradiol, progesterone, and cortisol in more than 200 subjects. Bids are significantly positively correlated and profits are significantly negatively correlated...

Applying unawareness belief structures introduced in Heifetz, Meier, and Schipper (2013a), we develop Bayesian games with unawareness, define equilibrium, and prove existence. We show how equilibria are extended naturally from lower to higher awareness levels and restricted from higher to lower...

This article provides a brief survey of the literature on unawareness and introduces the contributions to the special issue on unawareness in Mathematical Social Sciences. First, we provide a brief overview both about epistemic models of unawareness and models of extensive-form games with...

One fundamental assumption often made in the literature on unawareness is that risk preferences are invariant to changes of awareness. We study how exposure to unawareness affects choices under risk. Participants in our experiment choose repeatedly between varying sure outcomes and a lottery in...

Recently there has been much theoretical and experimental work on learning in games. However, learning usually means "learning about the strategic behavior of opponents" rather than "learning about the game" as such. In contrast, here we report on an experiment designed to test whether players...

We prove a no-speculative-trade theorem under unawareness for the infinite case. This generalizes the result for the finite case by Heifetz, Meier, and Schipper (2013).

We characterize the class of symmetric two-player games in which tit-for-tat cannot be beaten even by very sophisticated opponents in a repeated game. It turns out to be the class of exact potential games. More generally, there is a class of simple imitation rules that includes tit-for-tat but...

We define an extensive-form analogue of iterated admissibility, called Prudent Rationalizability (PR). In each round of the procedure, for each information set of a player a surviving strategy of hers is required to be rational vis-a-vis a belief system with a full-support belief on the...

We show that in symmetric two-player exact potential games, the simple decision rule imitate-if-better cannot be beaten by any strategy in a repeated game by more than the maximal payoff difference of the one-period game. Our results apply to many interesting games including examples like 2x2...