406 search results - page 2 / 82 » Games with Opacity Condition |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We prove that optimal strategies exist in perfect-information stochastic games with finitely many states and actions and tail winning conditions.
DIGRA
2003
Springer
15 years 2 months ago
2003
Springer
We advocate a research approach to determining the conditions of engagement in game simulation that is a multi-disciplinary cultural and scientific inquiry at the juncture of psyc...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
101
Voted
IPL
2008
14 years 9 months ago
2008
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...
FSTTCS
2003
Springer
15 years 2 months ago
2003
Springer
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...