scientific article; zbMATH DE number 7559118

DOI10.4230/LIPICS.STACS.2019.9MaRDI QIDQ5090455FDOQ5090455

Pierre Coucheney, Yann Strozecki, David Auger

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1901.05316

Title of this publication is not available (Why is that?)

zbMATH Keywords

randomized algorithmparametrized complexitysimple stochastic gamesBland's rulestrategy improvement

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• The complexity of stochastic games
• Stochastic Games
• On the Complexity of Nash Equilibria and Other Fixed Points
• Title not available (Why is that?)
• Automatic verification of competitive stochastic systems
• New Finite Pivoting Rules for the Simplex Method
• A subexponential randomized algorithm for the simple stochastic game problem
• On Stochastic Games with Multiple Objectives
• The complexity of solving stochastic games on graphs
• Solving Simple Stochastic Games with Few Coin Toss Positions
• Title not available (Why is that?)
• Simple Stochastic Games with Few Random Vertices Are Easy to Solve
• On Nonterminating Stochastic Games
• Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
• Deterministic Graphical Games Revisited
• Bisimulation, modal logic and model checking games
• On strategy improvement algorithms for simple stochastic games
• Title not available (Why is that?)
• An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
• Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games
• Deciding parity games in quasipolynomial time
• New results on simple stochastic games

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090455)