33 citations · 81 across the 32 of their papers we have counts for
Showing 2015 · cs.GTShow all
2 papers · 2 filters
cs.GT2015
A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games
Endre Boros, Khaled Elbassioni, Vladimir Gurvich +1
We suggest a new algorithm for two-person zero-sum undiscounted stochastic games focusing on stationary strategies. Given a positive real , let us call a stochastic game -erg…
cs.GT2015★ 1 cited
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions
Endre Boros, Khaled Elbassioni, Vladimir Gurvich +1
We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph , with local rewards $r: E \to \ZZ$, and three t…