Stackelberg security games: Computing the shortest-path equilibrium
A real security game is represented as a shortest-path game using a Lyapunov theory. The problem of finding pure and mixed strategies became computationally tractable. We introduce a joint c-variable to reformulate the problem as linear programming. We provide a method for constructing a Lyapunov-like function. We prove that the convergence of the method to a strong equilibrium is exponential.
security games shortest-path games strong stackelberg equilibrium lyapunov equilibrium lyapunov games complexity analysis repeated markov games