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 ļ¬...
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...
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
We present GAMUT1 , a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationshi...
Eugene Nudelman, Jennifer Wortman, Yoav Shoham, Ke...
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...