Convergence of Multi-Scale Reinforcement Q-Learning Algorithms for Mean Field Game and Control Problems
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910429777756160 |
|---|---|
| author | Angiuli, Andrea Fouque, Jean-Pierre Laurière, Mathieu Zhang, Mengrui |
| author_facet | Angiuli, Andrea Fouque, Jean-Pierre Laurière, Mathieu Zhang, Mengrui |
| contents | We establish the convergence of the unified two-timescale Reinforcement Learning (RL) algorithm presented in a previous work by Angiuli et al. This algorithm provides solutions to Mean Field Game (MFG) or Mean Field Control (MFC) problems depending on the ratio of two learning rates, one for the value function and the other for the mean field term. Our proof of convergence highlights the fact that in the case of MFC several mean field distributions need to be updated and for this reason we present two separate algorithms, one for MFG and one for MFC. We focus on a setting with finite state and action spaces, discrete time and infinite horizon. The proofs of convergence rely on a generalization of the two-timescale approach of Borkar. The accuracy of approximation to the true solutions depends on the smoothing of the policies. We provide a numerical example illustrating the convergence. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_06659 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Convergence of Multi-Scale Reinforcement Q-Learning Algorithms for Mean Field Game and Control Problems Angiuli, Andrea Fouque, Jean-Pierre Laurière, Mathieu Zhang, Mengrui Optimization and Control We establish the convergence of the unified two-timescale Reinforcement Learning (RL) algorithm presented in a previous work by Angiuli et al. This algorithm provides solutions to Mean Field Game (MFG) or Mean Field Control (MFC) problems depending on the ratio of two learning rates, one for the value function and the other for the mean field term. Our proof of convergence highlights the fact that in the case of MFC several mean field distributions need to be updated and for this reason we present two separate algorithms, one for MFG and one for MFC. We focus on a setting with finite state and action spaces, discrete time and infinite horizon. The proofs of convergence rely on a generalization of the two-timescale approach of Borkar. The accuracy of approximation to the true solutions depends on the smoothing of the policies. We provide a numerical example illustrating the convergence. |
| title | Convergence of Multi-Scale Reinforcement Q-Learning Algorithms for Mean Field Game and Control Problems |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2312.06659 |