Abstract
Fictitious Play (FP) is a popular algorithm known to achieve Nash equilibrium learning in certain large-scale games. However, for games with many players, the computational demands of the FP algorithm can be prohibitive. Sampled FP (SFP) is a variant of FP that mitigates computational demands via a Monte Carlo approach. While SFP does mitigate the complexity of FP, it can be shown that SFP still uses information in an inefficient manner. The paper generalizes the SFP convergence result and studies a stochastic-approximation-based variant that significantly reduces the complexity of SFP.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.