Pith. sign in

REVIEW 2 cited by

Exact Algorithms for Solving Stochastic Games

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1202.3898 v1 pith:EKRBOLD2 submitted 2012-02-17 cs.GT

Kristoffer Arnsfelt Hansen , Michal Koucky , Niels Lauritzen , Peter Bro Miltersen , Elias Tsigaridas This is my paper · ORCID
classification cs.GT
keywords gamesstochasticalgorithmssolvingclassicaldescribedescribingdiscounted
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Monotone Contractions

    cs.CC 2024-11 conditional novelty 8.0 of 10

    A fixed point of a d-dimensional monotone contraction can be found in O((c log(1/ε))^{ceil(d/3)}) queries, improving on previous bounds, and the problem lies in UEOPL.

  2. Existence and computation of monomial families of near-optimal strategies for recursive games

    cs.GT 2026-08 accept novelty 7.0 of 10

    Every finite recursive game has near-optimal stationary strategies that are simple monomials in the accuracy epsilon, and for fixed state count these can be computed exactly in polynomial time.

Pith tools