Steering No-Regret Agents in MFGs under Model Uncertainty
Not on the map. Why?
Abstract (arXiv)
Incentive design is a popular framework for guiding agents' learning dynamics towards desired outcomes by providing additional payments beyond intrinsic rewards. However, most existing works focus on a finite, small set of agents or assume complete knowledge of the game, limiting their applicability to real-world scenarios involving large populations and model uncertainty. To address this gap, we study the design of steering rewards in Mean-Field Games (MFGs) with density-independent transitions, where both the transition dynamics and intrinsic reward functions are unknown. This setting presents non-trivial challenges, as the mediator must incentivize the agents to explore for its model learning under uncertainty, while simultaneously steer them to converge to desired behaviors without incurring excessive incentive payments. Assuming agents exhibit no(-adaptive) regret behaviors, we contribute novel optimistic exploration algorithms. Theoretically, we establish sub-linear regret guarantees for the cumulative gaps between the agents' behaviors and the desired ones. In terms of the steering cost, we demonstrate that our total incentive payments incur only sub-linear excess, competing with a baseline steering strategy that stabilizes the target policy as an equilibrium. Our work presents an effective framework for steering agents behaviors in large-population systems under uncertainty.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 28 of its 63 references that are in the map. First posted on arXiv 12 Mar 2025.
Builds on
28 of 63 references.
References · 28
- 2019Introduction to Online Convex Optimizationcited by 793
- 2014Model-based Reinforcement Learning and the Eluder Dimensioncited by 116
- 2019Online Convex Optimization in Adversarial Markov Decision Processescited by 79
- 2022Learning in Mean Field Games: A Surveycited by 56
- 2019Strategizing against No-regret Learnerscited by 48
- 2014Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problemscited by 46
- 2022The Sample Complexity of Online Contract Designcited by 35
- 2021Scaling up Mean Field Games with Online Mirror Descentcited by 29
- 2022Policy Mirror Ascent for Efficient and Independent Learning in Mean Field Gamescited by 24
- 2023Is Learning in Games Good for the Learners?cited by 19
- 2020Mechanisms for a No-Regret Agent: Beyond the Common Priorcited by 18
- 2021Adaptive Incentive Design with Multi-Agent Meta-Gradient Reinforcement Learningcited by 18
16 more
- 2022Multi-Agent Contractscited by 14
- 2023On the Statistical Efficiency of Mean-Field Reinforcement Learning with General Function Approximationcited by 13
- 2024Incentivized Learning in Principal-Agent Bandit Gamescited by 13
- 2021Coordinating Followers to Reach Better Equilibria: End-to-End Gradient Descent for Stackelberg Gamescited by 10
- 2018Adaptive Mechanism Design: Learning to Promote Cooperationcited by 9
- 2024Model-Based RL for Mean-Field Games is not Statistically Harder than Single-Agent RLcited by 9
- 2021Inducing Equilibria via Incentives: Simultaneous Design-and-Play Ensures Global Convergencecited by 8
- 2016A tale of a Principal and many many Agentscited by 7
- 2021Solving N-player dynamic routing games with congestion: a mean field approachcited by 7
- 2024Automated Design of Affine Maximizer Mechanisms in Dynamic Settingscited by 7
- 2023Multi-Agent Contract Design: How to Commission Multiple Agents with Individual Outcomecited by 6
- 2023Steering No-Regret Learners to a Desired Equilibriumcited by 6
- 2024MF-OML: Online Mean-Field Reinforcement Learning with Occupation Measures for Large Population Gamescited by 5
- 2024Learning to Steer Markovian Agents under Model Uncertaintycited by 2
- 2022Incentive Designs for Stackelberg Games with a Large Number of Followers and their Mean-Field Limitscited by 1
- 2023MESOB: Balancing Equilibria & Social Optimalitycited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Microeconomic Foundations of Multi-Agent Learningcited by 0
- 2026Microeconomic Foundations of Multi-Agent Learning6 Jan 2026