We study the degree to which small fluctuations in costs in wellstudied potential games can impact the result of natural best-response and improved-response dynamics. We call thi...
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm...
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...