On strategy improvement algorithms for simple stochastic games
type: Item
instance of: scholarly article
title: On strategy improvement algorithms for simple stochastic games
zbMATH Open document ID: 1219.68168
author: Rahul Tripathi
author: Elena Valkanova
author: V. S. Anil Kumar
published in: Journal of Discrete Algorithms
publication date: 2011-08-23T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 91A15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5941899
zbMATH Keywords: algorithms
zbMATH Keywords: computational complexity
zbMATH Keywords: stochastic games
zbMATH Keywords: strategy improvement algorithms
zbMATH Keywords: optimal strategies
MaRDI profile type: Publication
full work available at URL: j.jda.2011.03.007
OpenAlex ID: W2002798367
cites work: The complexity of stochastic games
cites work: Q4287357
cites work: Finite state Markovian decision processes
cites work: Solving Simple Stochastic Games with Few Random Vertices
cites work: Automata, logics, and infinite games. A guide to current research
cites work: Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
cites work: On Nonterminating Stochastic Games
cites work: Q3266141
cites work: Q4255576
cites work: A subexponential randomized algorithm for the simple stochastic game problem
cites work: On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes
cites work: Verifying minimum stable circuit values
cites work: Stochastic Games
cites work: New algorithms for solving simple stochastic games
cites work: On Strategy Improvement Algorithms for Simple Stochastic Games
cites work: Q2754084
cites work: The complexity of mean payoff games on graphs
DOI: 10.1016/J.JDA.2011.03.007
description: scientific article; zbMATH DE number 5941899