Comparison of algorithms for simple stochastic games

Simple stochastic games are turn-based 2½-player zero-sum graph games with a reachability objective. The problem is to compute the winning probabilities as well as the optimal strategies of both players. In this paper, we compare the three known classes of algorithms – value iteration, strategy iter...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information and computation Jg. 289; S. 104885
Hauptverfasser:	Křetínský, Jan, Ramneantu, Emanuel, Slivinskiy, Alexander, Weininger, Maximilian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.11.2022
Schlagworte:	Algorithms Formal methods Probabilistic verification Quadratic programming Stochastic games Strategy iteration Value iteration Stochastic games Strategy iteration Algorithms Probabilistic verification Value iteration Formal methods Quadratic programming
ISSN:	0890-5401, 1090-2651
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!