Metraipolis › archive › dc_47335019fcd9

Inertia-Corrected Newton Method For Generalized Nash Equilibria in Dynamic Games with Optimality Verification — arXiv:2609.31929

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.31929
License (as archived)
CC0-1.0
Archived
2026-10-07T22:14:07.863Z
SHA-256 of the archived text
98688deb9e72bfe4b681711037e85df5592911b29f3a813fbbf2986fe8ecbb98
Stable URL of this page
https://metraipolis.com/documento/dc_47335019fcd9

How to cite

Inertia-Corrected Newton Method For Generalized Nash Equilibria in Dynamic Games with Optimality Verification — arXiv:2609.31929 — arXiv (en), https://arxiv.org/abs/2609.31929 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_47335019fcd9 (Metraipolis archive dc_47335019fcd9, sha256 98688deb9e72bfe4b681711037e85df5592911b29f3a813fbbf2986fe8ecbb98)
BibTeX
@misc{dc47335019fcd9,
  title = {Inertia-Corrected Newton Method For Generalized Nash Equilibria in Dynamic Games with Optimality Verification — arXiv:2609.31929},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31929},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_47335019fcd9; sha256 98688deb9e72bfe4b681711037e85df5592911b29f3a813fbbf2986fe8ecbb98},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31929. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Newton methods efficiently find Generalized Nash Equilibria (GNE) in dynamic games by solving for the KKT necessary conditions. These methods are fast and can support multi-agent Model Predictive Control (MPC) for highly dynamic robots. However, a small KKT residual alone does not certify that the returned solution satisfies the second-order sufficient conditions for a local GNE. In this paper, we propose an efficient numerical method to verify the second-order sufficient conditions (SOSC) for a local GNE. We connect the inertia of the agent KKT matrix with the positive definiteness of the reduced Hessian of the cost function, projected onto the null space of the constraints. Furthermore, we introduce an inertia-corrected update step that improves convergence to local GNEs by destabilizing strict saddle points with weak cross-agent coupling. Our main contribution is a fast Newton solver for Constrained Dynamic Games that provides efficient optimality checking. Through numerical benchmarks, we demonstrate the proposed solver's runtime and convergence performance in practical multi-agent planning problems. We also validate the solver's real-time capabilities in physical experiments using a platform of miniature autonomous race cars.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-09-29 in cs.GT).
Categorie arXiv: Robotics (cs.RO) ; Computer Science and Game Theory (cs.GT).
Pagina del lavoro: https://arxiv.org/abs/2609.31929 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T21:55:21.857Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).