Sciweavers

230 search results - page 10 / 46
» Computing Optimal Strategies to Commit to in Stochastic Game...
Sort
View
76
Voted
IPPS
2002
IEEE
15 years 2 months ago
Optimal Remapping in Dynamic Bulk Synchronous Computations via a Stochastic Control Approach
A bulk synchronous computation proceeds in phases that are separated by barrier synchronization. For dynamic bulk synchronous computations that exhibit varying phase-wise computat...
Gang George Yin, Cheng-Zhong Xu, Le Yi Wang
64
Voted
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
14 years 11 months ago
Quantitative stochastic parity games
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...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
LICS
2009
IEEE
15 years 4 months ago
Qualitative Determinacy and Decidability of Stochastic Games with Signals
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...
Nathalie Bertrand, Blaise Genest, Hugo Gimbert
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 1 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
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 ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
87
Voted
IPCO
2010
125views Optimization» more  IPCO 2010»
14 years 11 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...