arXiv AI By Shuxin Zhuang, Shuxin Li, Tianji Yang, Muheng Li, Xianjie Shi, Bo An, Youzhi Zhang

GraphChase: A Platform and Benchmark for Urban Network Security Games

Read the original on arXiv AI →

arXiv:2501. 17559v2 Announce Type: replace Abstract: After the achievement of solving two-player zero-sum games, more AI researchers focus on solving multiplayer games.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Sep 18

JointMatch: A Unified Heterogeneous Graph Neural Solver for Large-Scale Ride-Sharing Matching

JointMatch is a learning-based framework that simultaneously handles request pairing and vehicle assignment for ride‑sharing using a single, sparsified heterogeneous graph neural network. By scoring all candidate decisions in one forward pass, it scales linearly with the number of vehicles and requests, outperforming classical heuristics and two‑stage GNN baselines on New York City Yellow Taxi data. The model achieves significant speedups—over 20× faster per dispatch epoch at city scale—and further improves revenue through supervised training and policy‑gradient fine‑tuning.

By Kun Zhao, Xu Chen
arXiv Machine Learning
Oct 8

Shared-Roadmap Generation and Evaluator for Multi-Agent Path Planning Using Heterogeneous Graph Neural Network

The paper introduces a scalable heterogeneous Graph Neural Network framework that automatically generates and evaluates shared roadmaps for multi‑agent path planning in continuous environments. By representing waypoints, agent locations, and task locations as distinct nodes, the GNN learns from expert solver trajectories to identify critical points and prune redundant connections, producing a compact, coordination‑aware roadmap. Experiments show the approach can reduce planning effort, achieving at least a 40% reduction in runtime and graph size for dense roadmaps.

By Brandon Ho, Nikola Rogers, Seung-Kyum Choi
arXiv Machine Learning
Sep 25

Graph-Based Inference and Topology-Aware Multi-Agent Reinforcement Learning for Large-Scale Railway Network Management

The paper presents a graph-based framework for large-scale railway network management, combining a hierarchical Bayesian model with a Gaussian Process on a graph kernel to infer spatially correlated maintenance environments from Swiss Federal Railways data. It introduces a topology-aware Multi-Agent Reinforcement Learning system that uses graph neural networks and Transformers to optimize network-level policies. The approach demonstrates scalability via zero-shot transfer learning, enabling agents trained on small network segments to perform effectively on unseen large networks, outperforming heuristics and standard MARL baselines while reducing training time.

By Giacomo Arcieri, Gregory Duth\'e, Christophe Muller, Konstantinos G. Papakonstantinou, Daniel Straub, Eleni Chatzi