6 papers · 1 filter
GraphChase: A Platform and Benchmark for Urban Network Security Games
Shuxin Zhuang, Shuxin Li, Tianji Yang +4
After the achievement of solving two-player zero-sum games, more AI researchers focus on solving multiplayer games. Urban Network Security Games (\textbf{UNSGs}) represent a class…
Nondeterministic Polynomial-time Problem Challenge: An Ever-Scaling Reasoning Benchmark for LLMs
Chang Yang, Ruiyu Wang, Junzhe Jiang +9
Reasoning is the fundamental capability of large language models (LLMs). Due to the rapid progress of LLMs, there are two main issues of current benchmarks: i) these benchmarks can…
In-Context Exploiter for Extensive-Form Games
Shuxin Li, Chang Yang, Youzhi Zhang +5
Nash equilibrium (NE) is a widely adopted solution concept in game theory due to its stability property. However, we observe that the NE strategy might not always yield the best re…
Configurable Mirror Descent: Towards a Unification of Decision Making
Pengdeng Li, Shuxin Li, Chang Yang +5
Decision-making problems, categorized as single-agent, e.g., Atari, cooperative multi-agent, e.g., Hanabi, competitive multi-agent, e.g., Hold'em poker, and mixed cooperative and c…
Grasper: A Generalist Pursuer for Pursuit-Evasion Problems
Pengdeng Li, Shuxin Li, Xinrun Wang +5
Pursuit-evasion games (PEGs) model interactions between a team of pursuers and an evader in graph-based environments such as urban street networks. Recent advancements have demonst…
Self-adaptive PSRO: Towards an Automatic Population-based Game Solver
Pengdeng Li, Shuxin Li, Chang Yang +4
Policy-Space Response Oracles (PSRO) as a general algorithmic framework has achieved state-of-the-art performance in learning equilibrium policies of two-player zero-sum games. How…