ベストレスポンス写像による動的ゲームのデータ駆動型構造分解
A Data Driven Structural Decomposition of Dynamic Games via Best Response Maps
動的ゲームのナッシュ均衡計算を、オフラインで学習したベストレスポンス写像を制約として組み込むことで、入れ子最適化と微分結合を除去する新定式化を提案し、理論的証明と大規模モンテカルロ実験で検証した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Mahdis Rabbani, Navid Mojahed, Shima Nazari
分類: cs.GT, cs.MA, cs.RO, cs.SY, eess.SY, math.OC
原文アブストラクト
Dynamic games are powerful tools to model multi-agent decision-making, yet computing Nash (generalized Nash) equilibria remains a central challenge in such settings. Complexity arises from tightly coupled optimality conditions, nested optimization structures, and poor numerical conditioning. Existing game-theoretic solvers address these challenges by directly solving the joint game, typically requiring explicit modeling of all agents' objective functions and constraints, while learning-based approaches often decouple interaction through prediction or policy approximation, sacrificing equilibrium consistency. This paper introduces a conceptually novel formulation for dynamic games by restructuring the equilibrium computation. Rather than solving a fully coupled game or decoupling agents through prediction or policy approximation, a data-driven structural reduction of the game is proposed that removes nested optimization layers and derivative coupling by embedding an offline-compiled best-response map as a feasibility constraint. Under standard regularity conditions, when the best-response operator is exact, any converged solution of the reduced problem corresponds to a local open-loop Nash (GNE) equilibrium of the original game; with a learned surrogate, the solution is approximately equilibrium-consistent up to the best-response approximation error. The proposed formulation is supported by mathematical proofs, accompanying a large-scale Monte Carlo study in a two-player open-loop dynamic game motivated by the autonomous racing problem. Comparisons are made against state-of-the-art joint game solvers, and results are reported on solution quality, computational cost, and constraint satisfaction.
関連論文
- 最良応答写像による非対称ナッシュ探索:大域的線形収束と不正確な反応モデルへの頑健性ゲーム理論/マルチエージェント
