Showing 1 - 10 of 2,567
We propose a simple adaptive procedure for playing a game. In this procedure, players depart from their current play with probabilities that are proportional to measures of regret for not having used other strategies (these measures are updated every period). It is shown that our adaptive...
Persistent link: https://www.econbiz.de/10014060837
Persistent link: https://www.econbiz.de/10010505293
Persistent link: https://www.econbiz.de/10001529148
Persistent link: https://www.econbiz.de/10000993778
In this paper I study the economics of self-enforcing international environmental agreements where agents never know what exactly the state of the world is. Explicitly, I consider countries using Bayesian learning to update their beliefs on the state of the world. Using a very simple framework...
Persistent link: https://www.econbiz.de/10014164277
Recently there has been much work on learning in games. However, learning usually means learning about behavior of opponents rather than learning about the game as such. Here we test in an experiment whether players in a repeated encounter can learn the payoff structures of their opponents by...
Persistent link: https://www.econbiz.de/10014118207
We introduce the algorithmic learning equations (ALEs), a set of ordinary differential equations which characterizes the finite-time and asymptotic behaviour of the stochastic interaction between state-dependent learning algorithms in dynamic games. Our framework allows for a variety of...
Persistent link: https://www.econbiz.de/10014079684
Recently there has been much work on learning in games. However, learning usually means "learning about behavior of opponents" rather than "learning about the game" as such. Here we test in an experiment whether players in a repeated encounter can learn the payoff structures of their opponents...
Persistent link: https://www.econbiz.de/10014136483
This paper studies fictitious play in networks of noncooperative two-person games. We show that continuous-time fictitious play converges to the set of Nash equilibria if the overall n-person game is zero-sum. Moreover, the rate of convergence is 1/T, regardless of the size of the network. In...
Persistent link: https://www.econbiz.de/10012902571
This paper studies the reinforcement learning of Erev and Roth with foregone payoff information in normal form games: players observe not only the realised payoffs but also foregone payoffs, the ones which they could have obtained if they had chosen the other actions. We provide conditions under...
Persistent link: https://www.econbiz.de/10012891626