Best-reply dynamics in large binary-choice anonymous games

Yakov Babichenko

Games and Economic Behavior, 2013, vol. 81, issue C, 130-144

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 cnlogn 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.

Keywords: Anonymous games; Best-reply dynamic; Rate of convergence (search for similar items in EconPapers)
JEL-codes: C73 (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825613000729
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:81:y:2013:i:c:p:130-144

DOI: 10.1016/j.geb.2013.04.007

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().