Best-Reply Dynamics in Large Anonymous Games

Yakov Babichenko
2012 Social Science Research Network  
PHONE: [972]-2-6584135 FAX: [972]-2-6513681 E-MAIL: URL: 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 cn logn steps for some constant c > 0). Second, Nash approximate equilibria are played by the dynamic with
more » ... a limit frequency of at least 1 − e −c n for some constant c > 0.
doi:10.2139/ssrn.2028522 fatcat:732sdspy7jceflomevcrrxchfa