Abstract

We analyze an N + 1 N+1 -player game and the corresponding mean field game with state space { 0 , 1 } \{0,1\} . The transition rate of the j j th player is the sum of his control α j \alpha ^j plus a minimum jumping rate η \eta . Instead of working under monotonicity conditions, here we consider an anti-monotone running cost. We show that the mean field game equation may have multiple solutions if η > 1 2 \eta > \frac {1}{2} . We also prove that although multiple solutions exist, only the one coming from the entropy solution is charged (when η = 0 \eta =0 ), and therefore resolve a conjecture of Hajek and Livesay.

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.