Abstract
The paper deals with systems composed of a large number of N interacting objects (e.g., agents, particles) controlled by two players defining a stochastic zero-sum game. The objects can be classified according to a finite set of classes or categories over which they move randomly. Because N is too large, the game problem is studied following a mean field approach. That is, a zero-sum game model $$\mathcal {GM}_{N}$$ , where the states are the proportions of objects in each class, is introduced. Then, letting $$N\rightarrow \infty $$ (the mean field limit) we obtain a new game model $$\mathcal {GM}$$ , independent on N, which is easier to analyze than $$\mathcal {GM}_{N}$$ . Considering a discounted optimality criterion, our objective is to prove that an optimal pair of strategies in $$\mathcal {GM}$$ is an approximate optimal pair as $$N\rightarrow \infty $$ in the original game model $$\mathcal {GM}_{N}$$ .
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.