Solving Simple Stochastic Games (Q3507435)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Solving Simple Stochastic Games	scientific article

Statements

scholarly article

0 references

Solving Simple Stochastic Games (English)

0 references

0 references

0 references

Logic and Theory of Algorithms

0 references

publication date

19 June 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-69407-6_24

0 references

The complexity of stochastic games

0 references

0 references

Exact solution of linear equations using p-adic expansions

0 references

Solving Simple Stochastic Games with Few Random Vertices

0 references

Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems

0 references

0 references

A subexponential randomized algorithm for the simple stochastic game problem

0 references

A polynomial-time algorithm, based on Newton's method, for linear programming

0 references

Stochastic Games

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-69407-6_24

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3507435

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3507435&oldid=35061531"