Mean Field Equilibrium in Multi-Armed Bandit Game with Continuous Reward
Not on the map. Why?
Abstract (arXiv)
Mean field game facilitates analyzing multi-armed bandit (MAB) for a large number of agents by approximating their interactions with an average effect. Existing mean field models for multi-agent MAB mostly assume a binary reward function, which leads to tractable analysis but is usually not applicable in practical scenarios. In this paper, we study the mean field bandit game with a continuous reward function. Specifically, we focus on deriving the existence and uniqueness of mean field equilibrium (MFE), thereby guaranteeing the asymptotic stability of the multi-agent system. To accommodate the continuous reward function, we encode the learned reward into an agent state, which is in turn mapped to its stochastic arm playing policy and updated using realized observations. We show that the state evolution is upper semi-continuous, based on which the existence of MFE is obtained. As the Markov analysis is mainly for the case of discrete state, we transform the stochastic continuous state evolution into a deterministic ordinary differential equation (ODE). On this basis, we can characterize a contraction mapping for the ODE to ensure a unique MFE for the bandit game. Extensive evaluations validate our MFE characterization, and exhibit tight empirical regret of the MAB problem.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 4 of its 36 references that are in the map. First posted on arXiv 3 May 2021.
Builds on
4 of 36 references.
References · 4
- 2018Mean Field Multi-Agent Reinforcement Learningcited by 202
- 2015Learning in Mean Field Games: the Fictitious Playcited by 37
- 2016Distributed Cell Association for Energy Harvesting IoT Devices in Dense Small Cell Networks: A Mean-Field Multi-Armed Bandit Approachcited by 2
- 2017Mean Field Equilibria for Resource Competition in Spatial Settingscited by 2
Built on by
Not cited yet.