Abstract

Fictitious play in infinitely repeated, randomly perturbed games is investigated. Dynamical systems theory is used to study the Markov process {xk}, whose state vector xk lists the empirical frequencies of player's actions in the first k games. For 2×2 games with countably many Nash distribution equilibria, we prove that sample paths converge almost surely. But for Jordan's 3×2 matching game, there are robust parameter values giving probability 0 of convergence. Applications are made to coordination and anticoordination games and to general theory. Proofs rely on results in stochastic approximation and dynamical systems. Journal of Economic Literature Classification Numbers: C72, C73.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.