A wealth of algorithms centered around (integer) linear programming have been proposed
to compute equilibrium strategies in security games with discrete states and actions …

Efficiently computing equilibria for multiplayer games is still an open challenge in
computational game theory. This paper focuses on computing Team-Maxmin Equilibria …

Most violent crimes happen in urban and suburban cities. With emerging tracking
techniques, law enforcement officers can have real-time location information of the esca** …

Traditional security games concern the optimal randomized allocation of human patrollers,
who can directly catch attackers or interdict attacks. Motivated by the emerging application of …

Finding Nash equilibrium in continuous action spaces is a challenging problem and has
applications in domains such as protecting geographic areas from potential attackers. We …

The computational study of adversarial interactions aiming at finding players' optimal
strategies and predicting the most likely outcome of a game is a central problem in Artificial …

Strong Stackelberg equilibrium (SSE) is the standard solution concept of Stackelberg
security games. As opposed to the weak Stackelberg equilibrium (WSE), the SSE assumes …

In many real-world scenarios, a team of agents coordinate with each other to compete
against an opponent. The challenge of solving this type of game is that the team's joint …

Real-world scenarios often involve dynamic interactions among competing agents, where
decisions are made considering actions taken by others. These situations can be modeled …

After the great achievement of solving two-player zero-sum games, more and more AI
researchers focus on solving multiplayer games. To facilitate the development of designing …