We explore the problem of imitation learning (IL) in the context of mean-field games (MFGs), where the goal is to imitate the behavior of a population of agents following a Nash …
In this paper, we introduce the maximum casual entropy Inverse Reinforcement Learning (IRL) problem for discrete-time mean-field games (MFGs) under an infinite-horizon …
L Song, D Li, X Xu - Information Sciences, 2025 - Elsevier
Maximum entropy inverse reinforcement learning algorithms have been extensively studied for learning rewards and optimizing policies using expert demonstrations. However, high …
We consider inverse reinforcement learning problems with concave utilities. Concave Utility Reinforcement Learning (CURL) is a generalisation of the standard RL objective, which …
Reinforcement learning algorithms for mean-field games offer a scalable framework for optimizing policies in large populations of interacting agents. Existing methods often depend …
Imitation learning (IL) is a powerful approach for acquiring optimal policies from demonstrated behaviors. However, applying IL to a large group of agents is arduous due to …