Quantitative propagation of chaos for mean field Markov decision process with common noise

preprint2022arXivOpen access

Abstract

We investigate propagation of chaos for mean field Markov Decision Process with common noise (CMKV-MDP), and when the optimization is performed over randomized open-loop controls on infinite horizon. We first state a rate of convergence of order MNγM_N^γ, where MNM_N is the mean rate of convergence in Wasserstein distance of the empirical measure, and γ∈(0,1]γ\in (0,1] is an explicit constant, in the limit of the value functions of NN-agent control problem with asymmetric open-loop controls, towards the value function of CMKV-MDP. Furthermore, we show how to explicitly construct (ε+O(MNγ))(ε+\mathcal{O}(M_N^γ))-optimal policies for the NN-agent model from εε-optimal policies for the CMKV-MDP. Our approach relies on sharp comparison between the Bellman operators in the NN-agent problem and the CMKV-MDP, and fine coupling of empirical measures.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.