We study investment and consumption decisions in a dynamic game under learning. To that end, we present a model in which agents not only extract a resource for consumption, but also invest in technology to improve the future stock. At the same time, the agents learn about the stochastic process...

We study investment and consumption decisions in a dynamic game under learning. To that end, we present a model in which agents not only extract a resource for consumption, but also invest in technology to improve the future stock. At the same time, the agents learn about the stochastic process...

This paper analyses the formation of international environmental agreements (IEAs) under uncertainty, focusing on the role of learning and risk aversion. It bridges two strands of literature: one focused on the role learning for the success of IEA formation when countries are risk neutral and...

A decision maker bets on the outcomes of a sequence of coin-tossings. At the beginning of the game the decision maker can choose one of two coins to play the game. This initial choice is irreversible. The coins can be biased and the player is uncertain about the nature of one (or possibly both)...

Models of learning and experimentation based on two-armed Poisson bandits addressed several important aspects related to strategic and motivational learning, but they are not suitable to study effects that accumulate over time. We propose a new class of models of strategic experimentation which...

Consider an infinitely repeated game where each player is characterized by a "type" which may be unknown to the other players in the game. Suppose further that each player's belief about others is independent of that player's type. Impose an absolute continuity condition on the ex ante beliefs...

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. We provide necessary and sufficient conditions for imitation to be unbeatable and show that it can only be beaten by much in games that are of...

We report experiments designed to test between Nash equilibria that are stable and unstable under learning. The “TASP” (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes....

We propose a learning dynamic with agents using samples of past play to estimate the distribution of other players' strategy choices and best responding to this estimate. To account for noisy play, estimated distributions over other players' strategy choices have full support in the other...

It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a...