1599 search results - page 42 / 320 » Algorithms for Parity Games |
136
click to vote
WINE
2007
Springer
15 years 10 months ago
2007
Springer
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 ï¬...
136
click to vote
AAAI
2010
15 years 4 months ago
2010
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...
138
click to vote
ATAL
2004
Springer
15 years 10 months ago
2004
Springer
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...
152
click to vote
FUN
2010
Springer
15 years 9 months ago
2010
Springer
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...
125
Voted
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In artificial intelligence literature there is a rising interest in studying strategic interaction situations. In these situations a number of rational agents act strateg...