Learning with minimal information in continuous games

Sebastian Bervoets, Mario Bravo, Mathieu Faure

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

While payoff-based learning models are almost exclusively devised for finite action games, where players can test every action, it is harder to design such learning processes for continuous games. We construct a stochastic learning rule, designed for games with continuous action sets, which requires no sophistication from the players and is simple to implement: players update their actions according to variations in own payoff between current and previous action. We then analyze its behavior in several classes of continuous games and show that convergence to a stable Nash equilibrium is guaranteed in all games with strategic complements as well as in concave games, while convergence to Nash equilibrium occurs in all locally ordinal potential games as soon as Nash equilibria are isolated.

Original languageEnglish
Pages (from-to)1471-1508
Number of pages38
JournalTheoretical Economics
Volume15
Issue number4
DOIs
StatePublished - Nov 2020
Externally publishedYes

Keywords

  • C6
  • C72
  • D83
  • Payoff-based learning
  • continuous games
  • stochastic approximation

Fingerprint

Dive into the research topics of 'Learning with minimal information in continuous games'. Together they form a unique fingerprint.

Cite this