Metraipolis › archive › dc_0ecded617f11

BRAID: Learning Equilibrium Maps in Interdependent Security Games via Weight-Tied Iterative Graph Neural Networks — arXiv:2608.14856

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.14856
License (as archived)
CC0-1.0
Archived
2026-10-18T19:08:01.013Z
SHA-256 of the archived text
9977a114f8f4c5d2f32af346ad56af9a72399509b178ffc2e95bd21f0c3fda14
Stable URL of this page
https://metraipolis.com/documento/dc_0ecded617f11

How to cite

BRAID: Learning Equilibrium Maps in Interdependent Security Games via Weight-Tied Iterative Graph Neural Networks — arXiv:2608.14856 — arXiv (en), https://arxiv.org/abs/2608.14856 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0ecded617f11 (Metraipolis archive dc_0ecded617f11, sha256 9977a114f8f4c5d2f32af346ad56af9a72399509b178ffc2e95bd21f0c3fda14)
BibTeX
@misc{dc0ecded617f11,
  title = {BRAID: Learning Equilibrium Maps in Interdependent Security Games via Weight-Tied Iterative Graph Neural Networks — arXiv:2608.14856},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.14856},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0ecded617f11; sha256 9977a114f8f4c5d2f32af346ad56af9a72399509b178ffc2e95bd21f0c3fda14},
  year = {2026}
}

Archived text

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

Computing Nash equilibria in interdependent security (IDS) games on networks is computationally expensive: best-response dynamics may need hundreds of iterations per instance, and downstream tasks such as auditing, stress-testing, and incentive design often require repeatedly re-solving the game under parameter perturbations. We propose BRAID, a Best-Response Amortized Iterative Dynamics model that uses a weight-tied iterative graph neural network to learn a direct map from game parameters to Nash equilibrium effort profiles, replacing iterative best response computation with a single forward pass that is up to 43X faster per instance. BRAID is derived from the best-response fixed-point structure of IDS games: its SUM aggregation reflects additive neighbor coupling, and a weight-tied gated recurrent unit (GRU) mirrors a damped best-response update. The same architecture applies across IDS specifications that vary investment-cost curvature and neighborhood aggregation, including log-linear, quadratic-cost, and log constant-elasticity-of-substitution (CES) utilities. Beyond equilibrium prediction, BRAID also recovers how equilibrium efforts change under perturbations to game parameters, including costs and network edge weights. We make this sensitivity recovery an explicit evaluation target and introduce two training strategies, interior-equilibrium training and input-noise regularization, that improve the local behavior of the learned equilibrium map without using sensitivity labels. Experiments show that BRAID effectively predicts Nash equilibria and recovers equilibrium sensitivities across utility specifications and network sizes.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-08-18 in cs.GT).
Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.14856 — 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-18T18:12:50.738Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).