Learning Mixed Strategies In Trajectory Games

Abstract

In multi-agent settings, game theory is a natural framework for describing the strategic interactions of agents whose objectives depend upon one another's behavior. Trajectory games capture these complex effects by design. In competitive settings, this makes them a more faithful interaction model than traditional "predict then plan" approaches. However, current game-theoretic planning methods have important limitations. In this work, we propose two main contributions. First, we introduce an offline training phase which reduces the online computational burden of solving trajectory games. Second, we formulate a lifted game which allows players to optimize multiple candidate trajectories in unison and thereby construct more competitive "mixed" strategies. We validate our approach on a number of experiments using the pursuit-evasion game "tag."

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keypeters2022learning

Related papers

• Learning Strategy Representation For Imitation Learning In Multi-agent Games (2024)0.00
• Conservative Equilibrium Discovery In Offline Game-theoretic Multiagent Reinforcement Learning (2026)0.00
• A Goal-based Movement Model For Continuous Multi-agent Tasks (2017)0.00
• Mimicking To Dominate: Imitation Learning Strategies For Success In Multiagent Competitive Games (2023)0.00
• Non-cooperative Multi-agent Systems With Exploring Agents (2020)0.00
• Learning From Good Trajectories In Offline Multi-agent Reinforcement Learning (2022)5.24
• An Active Learning Method For Solving Competitive Multi-agent Decision-making And Control Problems (2022)3.58
• Developing, Evaluating And Scaling Learning Agents In Multi-agent Environments (2022)2.26