The theory of learning in games explores how, which, and what kind of equilibria might arise as a consequence of a long-run nonequilibrium process of learning, adaptation, and/or imitation. If agents’ strategies are completely observed at the end of each round (and agents are randomly matched...

In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players...

Harsányi [4] showed that Bayesian games over finite games of payoff uncertainty with finite sets of belief types always admit Bayesian equilibria. That still left the question of whether Bayesian games over finite games of payoff uncertainty with infinitely many types are guaranteed to have...

In the paper, the concept of Walrasian sequential equilibrium is developed to formalize the notions of fundamental social and endogenous uncertainties and decentralized social learning. It predicts that social sequential experiments with efficient as well as inefficient network patterns of...

In each stage of a repeated game with private monitoring, the players receive payoffs and privately observe signals which depend on the players' actions and the state of world. I show that, contrary to a widely held belief, such games admit a recursive structure. More precisely, I construct a...

Two-player zero-sum stochastic games with finite state and action spaces are known to have undiscounted values. We study such games under the assumption that one or both players observe the actions of their opponent after some time-dependent delay. We develop criteria for the rate of growth of...

We study mechanism design in non-Bayesian settings of incomplete information, when the designer has no information about the players, and the players have arbitrary, heterogeneous, first-order, and possibilistic beliefs about their opponents' payoff types.

The extensive form game we study has multiple perfect equilibria, but it has a unique limiting logit equilibrium (QRE) and a unique level-k prediction as k approaches infinity. The convergence paths of QRE and level-k are different, but they converge to the same limit point. We analyze whether...

Making use of and following substantive rationality is a costly and not always feasible option. In games, this option generates two levels of reasoning. The player has to decide how to play the overt game, but this requires him to decide how to play an underlying game in which the alternatives...

We prove that the structure theorem for rationalizability originally from Weinstein and Yildiz (2007) applies to any finite extensive-form game with perfect recall and suitably rich payoffs. We demonstrate that the ties induced by the extensive form do not change the result of Weinstein and...