Preprint submitted to Theory of Computing Systems June 7, 2011 On the Rate of Convergence of Fictitious Play Felix Brandt · Felix Fischer · Paul Harrenstein - Paul Nash - Document - PDFSEARCH.IO

First Page	Meta Content
	Preprint submitted to Theory of Computing Systems June 7, 2011 On the Rate of Convergence of Fictitious Play Felix Brandt · Felix Fischer · Paul Harrenstein Add to Reading List Document Date: 2011-06-07 11:38:55 Open Document File Size: 292,09 KB Share Result on Facebook / Facility Harvard University / / IndustryTerm much more sophisticated learning algorithms / earliest and simplest algorithms / approximate solutions / learning algorithm / learning algorithms / / Organization de F. Fischer School of Engineering and Applied Sciences / P. Harrenstein Institut f¨ / Harvard University / / Person Paul Harrenstein Abstract Fictitious / Nash Equilibrium / Felix Brandt / / Position row player / player / column player / / ProgrammingLanguage FP / / Technology learning algorithm / artificial intelligence / earliest and simplest algorithms / / SocialTag Economics Nash equilibrium Fictitious play Best response Zero–sum game Symmetric game Normal-form game Minimax Solution concept Game theory

Preprint submitted to Theory of Computing Systems June 7, 2011 On the Rate of Convergence of Fictitious Play Felix Brandt · Felix Fischer · Paul HarrensteinAdd to Reading List