Nash Equilibrium Approximation under Communication and Computation Constraints in Large-Scale Non-cooperative Games

This paper studies the problem of Nash equilibrium approximation in large-scale heterogeneous (static) mean-field games under communication and computation constraints. A deterministic mean-field game is considered in which the utility function of each agent depends on its action, the average of other agents' actions (called the mean variable of that agent) and a deterministic parameter. It is shown that the equilibrium mean variables of all agents converge uniformly to a constant, called asymptotic equilibrium mean (AEM), as the number of agents tends to infinity. Next, the problem of approximating the AEM at a processing center under communication and computation constraints is studied. Three approximation methods are proposed to substantially reduce the communication and computation costs of approximating AEM at the processing center. In particular, a quantized communication scheme is considered which significantly reduces the cost of transmitting agents' parameters to the processing center while a certain accuracy level for approximating AEM at the processing center is guaranteed. The accuracy of the proposed approximation methods is analyzed and illustrated through numerical examples.