| Sumario: | This paper considers a simple adaptive learning rule in Bayesian games with binary actions where players employ threshold strategies. Global convergence results are given for supermodular games and potential games. If there is a unique equilibrium, players’ strategies converge almost surely to it. Even if there is not, in potential games and in the two-player case in supermodular games, any limit point of the learning process must be an equilibrium. In particular, if equilibria are isolated, the learning process converges to one of them almost surely.
|
|---|