mlsanityData to 7 Oct 2026

GraphChase: A Platform and Benchmark for Urban Network Security Games

arXiv 2501.17559 ↗First posted 29 Jan 2025cs.AI cs.GTcited by 2

Not on the map. Why?

Abstract (arXiv)

After the achievement of solving two-player zero-sum games, more AI researchers focus on solving multiplayer games. Urban Network Security Games (UNSGs) represent a class of such games, modeling real-world scenarios where law enforcement must strategically allocate limited resources to intercept criminals escaping within urban networks, and have gained considerable research attention. However, progress in this field has been limited by the absence of a standardized experimental platform and realistic benchmarks with heterogeneous travel costs. To address this limitation, we introduce GraphChase, an open-source platform designed to support the development and evaluation of algorithms for UNSGs. GraphChase offers a unified environment for modeling diverse UNSG variants on unweighted and weighted road networks across urban topologies. It also incorporates learning-based algorithms as baseline references for researchers. Furthermore, our experiments with GraphChase reveal that existing approaches to UNSGs still face challenges in terms of robustness and scalability, and suffer performance degradation when deployed under weighted edge costs, highlighting a sim-to-real generalization gap. GraphChase thus provides a realistic testbed for developing and validating UNSGs solvers under realistic travel-time heterogeneity.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 17 of its 73 references that are in the map. First posted on arXiv 29 Jan 2025.

Builds on

17 of 73 references.

References · 17

  1. 2019The StarCraft Multi-Agent Challengecited by 589
  2. 2017A Unified Game-Theoretic Approach to Multiagent Reinforcement Learningcited by 265
  3. 2019Google Research Football: A Novel Reinforcement Learning Environmentcited by 257
  4. 2019OpenSpiel: A Framework for Reinforcement Learning in Gamescited by 180
  5. 2017Computational Results for Extensive-Form Adversarial Team Gamescited by 18
  6. 2016Team-maxmin equilibrium: efficiency bounds and algorithmscited by 9
  7. 2021Solving Large-Scale Extensive-Form Network Security Games via Neural Fictitious Self-Playcited by 7
  8. 2021Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositionscited by 6
  9. 2022A Marriage between Adversarial Team Games and 2-player Games: Enabling Abstractions, No-regret Learning, and Subgame Solvingcited by 6
  10. 2024Grasper: A Generalist Pursuer for Pursuit-Evasion Problemscited by 6
  11. 2016Dynamic Programming for One-Sided Partially Observable Pursuit-Evasion Gamescited by 5
  12. 2020Computing Ex Ante Coordinated Team-Maxmin Equilibria in Zero-Sum Multiplayer Extensive-Form Gamescited by 5
5 more
  1. 2022Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generationcited by 5
  2. 2021CFR-MIX: Solving Imperfect Information Extensive-Form Games with Combinatorial Action Spacecited by 4
  3. 2022Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimizationcited by 4
  4. 2022NSGZero: Efficiently Learning Non-Exploitable Policy in Large-Scale Network Security Games with Neural Monte Carlo Tree Searchcited by 3
  5. 2023Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Gamescited by 3

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.