Robustness and Approximation of Discrete-time Mean-field Games under Discounted Cost Criterion
In this paper, we investigate the robustness of stationary mean-field equilibria in the presence of model uncertainties, specifically focusing on infinite-horizon discounted cost functions. To achieve this, we initially establish convergence conditions for value iteration-based algorithms in mean-field games. Subsequently, utilizing these results, we demonstrate that the mean-field equilibrium obtained through this value iteration algorithm remains robust even in the face of system dynamics misspecifications. We then apply these robustness findings to the finite model approximation problem in mean-field games, showing that if the state space quantization is fine enough, the mean-field equilibrium for the finite model closely approximates the nominal one.
Code (0)
등록된 구현이 없습니다.
Tasks
QuantizationSimilar Papers 제목 키워드 기반
Actor-Critic Provably Finds Nash Equilibria of Linear-Quadratic Mean-Field Games
We study discrete-time mean-field Markov games with infinite numbers of agents where each agent aims to minimize its ergodic cost. We consider the setting where the agents have identical linear state transitions and quad…
Reinforcement LearningMean-Field PhiBE: Continuous-Time Mean-Field Reinforcement Learning from Discrete-Time Data
This paper addresses model-free continuous-time mean-field control in a setting where the population dynamics evolve continuously according to an unknown McKean-Vlasov stochastic differential equation, while only discret…
Reinforcement LearningOn the Convergence of Min-Max Langevin Dynamics and Algorithm
We study zero-sum games in the space of probability distributions over the Euclidean space $\mathbb{R}^d$ with entropy regularization, in the setting when the interaction function between the players is smooth and strong…
Mean field limits for discrete-time dynamical systems via kernel mean embeddings
Mean field limits are an important tool in the context of large-scale dynamical systems, in particular, when studying multiagent and interacting particle systems. While the continuous-time theory is well-developed, few w…
Stochastic Approximation Algorithms for Systems of Interacting Particles
Interacting particle systems have proven highly successful in various machine learning tasks, including approximate Bayesian inference and neural network optimization. However, the analysis of these systems often relies …