Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

Solving Simple Stochastic Games with Few Random Vertices

Hugo Gimbert ; Florian Horn.
Simple stochastic games are two-player zero-sum stochastic games with turn-based moves, perfect information, and reachability winning conditions. We present two new algorithms computing the values of simple stochastic games. Both of them rely on the existence of optimal permutation strategies, a&nbsp;[&hellip;]
Published on May 25, 2009

Deciding the value 1 problem for probabilistic leaktight automata

Nathanaël Fijalkow ; Hugo Gimbert ; Edon Kelmendi ; Youssouf Oualhadj.
The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1? This problem was proved undecidable recently; to overcome this, several classes of probabilistic automata of&nbsp;[&hellip;]
Published on June 23, 2015

  • < Previous
  • 1
  • Next >