Heifetz, Meier and Schipper (2013) introduced generalized extensive-form games that allow for asymmetric unawareness. Here, we study the normal form of a generalized extensiveform game. The generalized normal-form game associated to a generalized extensive-form game with unawareness may consist...

Level-k thinking and Cognitive Hierarchy have been widely applied as a normalform solution concept in behavioral and experimental game theory. We consider the extension of level-k thinking to extensive-form games. Player's may learn about levels of opponents' thinking during the play of the game...

It is well known that the rock-paper-scissors game has no pure saddle point. Weshow that this holds more generally: A symmetric two-player zero-sum game hasa pure saddle point if and only if it is not a generalized rock-paper-scissors game.Moreover, we show that every finite symmetric...

We show that for many classes of symmetric two-player games, the simple decision rule \imitate-the-best" can hardly be beaten by any other decision rule. Weprovide necessary and sufficient conditions for imitation to be unbeatable and showthat it can only be beaten by much in games that are of...

We define a cautious version of extensive-form rationalizability for generalized extensive-form games with unawareness that we call prudent rationalizability. It is an extensive-form analogue of iterated admissibility. In each round of the procedure, for each tree and each information set of a...

We seek an evolutionary explanation for why in some situations humans maintain either optimistic or pessimistic attitudes towards uncertainty and are ignorant to relevant aspects of their environment. Players in strategic games face Knightian uncertainty about opponents' actions and maximize...

Equilibrium notions for games with unawareness in the literature cannot be interpreted as steady-states of a learning process because players may discover novel actions during play. In this sense, many games with unawareness are ''self-destroying'' as a player's representation of the game may...

We use an experiment to explore how subjects learn to play against computers which are programmed to follow one of a number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious play, imitation, reinforcement learning, and a trial...

Vega-Redondo (1997) showed that imitation leads to the Walrasian outcome in Cournot Oligopoly. We generalize his result to aggregative quasi-submodular games. Examples are the Cournot Oligopoly, Bertrand games with differentiated complementary products, Common- Pool Resource games, Rent-Seeking...

We present a formal model of symmetric n-firm Cournot oligopoly with a heterogeneous population of profit optimizers and imitators. Imitators mimic the output decision of the most successful firms of the previous round a la Vega-Redondo (1997). Optimizers play myopic best response to the...