DOIAbstract
AbstractWe consider the complexity of stochastic games—simple games of chance played by two players. We show that the problem of deciding which player has the greatest chance of winning the game is in the class NP ⌢ co-NP
AbstractWe consider the complexity of stochastic games—simple games of chance played by two players. We show that the problem of deciding which player has the greatest chance of winning the game is in the class NP ⌢ co-NP
Simple stochastic games are two-player zero-sum stochastic games with turn-based moves, perfect info...
We consider two-player innite games played on graphs. The games are concurrent, in that at each stat...
A stochastic game is a two-player game played oil a graph, where in each state the successor is chos...
AbstractWe consider the complexity of stochastic games—simple games of chance played by two players....
We consider the complexity of stochastic games � simple games of chance played by two players. We s...
AbstractWe present new algorithms for determining optimal strategies for two-player games with proba...
The theory of graph games with ω-regular winning conditions is the foundation for modeling and synth...
AbstractThe theory of graph games with ω-regular winning conditions is the foundation for modeling a...
Stochastic games provide a versatile model for reactive systems that are affected by random events. ...
A stochastic game is a two-player game played oil a graph, where in each state the successor is chos...
Abstract. The theory of graph games with!-regular winning condi-tions is the foundation for modeling...
A simple stochastic game (SSG) is a game defined on a directed multigraph and played between players...
AbstractThe study of simple stochastic games (SSGs) was initiated by Condon for analyzing the comput...
We study the problem of deciding the winner of reachability switching games for zero-, one-, and two...
We study the problem of deciding the winner of reachability switching games for zero-, one-, and two...
Simple stochastic games are two-player zero-sum stochastic games with turn-based moves, perfect info...
We consider two-player innite games played on graphs. The games are concurrent, in that at each stat...
A stochastic game is a two-player game played oil a graph, where in each state the successor is chos...
AbstractWe consider the complexity of stochastic games—simple games of chance played by two players....
We consider the complexity of stochastic games � simple games of chance played by two players. We s...
AbstractWe present new algorithms for determining optimal strategies for two-player games with proba...
The theory of graph games with ω-regular winning conditions is the foundation for modeling and synth...
AbstractThe theory of graph games with ω-regular winning conditions is the foundation for modeling a...
Stochastic games provide a versatile model for reactive systems that are affected by random events. ...
A stochastic game is a two-player game played oil a graph, where in each state the successor is chos...
Abstract. The theory of graph games with!-regular winning condi-tions is the foundation for modeling...
A simple stochastic game (SSG) is a game defined on a directed multigraph and played between players...
AbstractThe study of simple stochastic games (SSGs) was initiated by Condon for analyzing the comput...
We study the problem of deciding the winner of reachability switching games for zero-, one-, and two...
We study the problem of deciding the winner of reachability switching games for zero-, one-, and two...
Simple stochastic games are two-player zero-sum stochastic games with turn-based moves, perfect info...
We consider two-player innite games played on graphs. The games are concurrent, in that at each stat...
A stochastic game is a two-player game played oil a graph, where in each state the successor is chos...
Add to ORKG