Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...