350 search results - page 7 / 70 » On Strategy Improvement Algorithms for Simple Stochastic Gam... |
108
click to vote
UAI
2000
14 years 10 months ago
2000
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
JSAC
2011
14 years 4 months ago
2011
—Various spectrum management schemes have been proposed in recent years to improve the spectrum utilization in cognitive radio networks. However, few of them have considered the ...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
101
click to vote
COCO
1994
Springer
15 years 1 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
SODA
2004
ACM
14 years 10 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...