44 search results - page 5 / 9 » The Complexity of Winning Strategies in Infinite Games |
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
Empirical analyses of complex games necessarily focus on a restricted set of strategies, and thus the value of empirical game models depends on effective methods for selectively e...
CLIMA
2010
13 years 10 months ago
2010
Half positionality is the property of a language of infinite words to admit positional winning strategies, when interpreted as the goal of a two-player game on a graph. Such proble...
JELIA
2004
Springer
14 years 2 months ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...