scientific article; zbMATH DE number 7559118
From MaRDI portal
Publication:5090455
DOI10.4230/LIPIcs.STACS.2019.9MaRDI QIDQ5090455
Pierre Coucheney, Yann Strozecki, David Auger
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1901.05316
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On strategy improvement algorithms for simple stochastic games
- The complexity of stochastic games
- A subexponential randomized algorithm for the simple stochastic game problem
- Automatic verification of competitive stochastic systems
- Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
- On Stochastic Games with Multiple Objectives
- Solving Simple Stochastic Games with Few Coin Toss Positions
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
- On the Complexity of Nash Equilibria and Other Fixed Points
- The Complexity of Solving Stochastic Games on Graphs
- New Results on Simple Stochastic Games
- New Finite Pivoting Rules for the Simplex Method
- Bisimulation, modal logic and model checking games
- Deciding parity games in quasipolynomial time
- Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve
- On Nonterminating Stochastic Games
- Stochastic Games
- Deterministic Graphical Games Revisited
This page was built for publication:
