Best-reply dynamics in large binary-choice anonymous games

Research output: Contribution to journalArticlepeer-review

Abstract

We consider small-influence anonymous games with a large number of players n where every player has two actions. For this class of games we present a best-reply dynamic with the following two properties. First, the dynamic reaches Nash approximate equilibria fast (in at most c nlogn steps for some constant c > 0). Second, Nash approximate equilibria are played by the dynamic with a limit frequency of at least 1-e-c'n for some constant c ' > 0.

Original languageEnglish
Pages (from-to)130-144
Number of pages15
JournalGames and Economic Behavior
Volume81
Issue number1
DOIs
StatePublished - Sep 2013
Externally publishedYes

Keywords

  • Anonymous games
  • Best-reply dynamic
  • Rate of convergence

All Science Journal Classification (ASJC) codes

  • Finance
  • Economics and Econometrics

Fingerprint

Dive into the research topics of 'Best-reply dynamics in large binary-choice anonymous games'. Together they form a unique fingerprint.

Cite this