Value iteration for simple stochastic games: Stopping criterion and learning algorithm

The classical problem of reachability in simple stochastic games is typically solved by value iteration (VI), which produces a sequence of under-approximations of the value of the game, but is only guaranteed to converge in the limit. We provide an additional converging sequence of over-approximatio...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information and computation Jg. 285; S. 104886
Hauptverfasser:	Eisentraut, Julia, Kelmendi, Edon, Křetínský, Jan, Weininger, Maximilian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.05.2022
Schlagworte:	Markov decision processes Probabilistic verification Reachability Stochastic games Value iteration Probabilistic verification Stochastic games Value iteration Markov decision processes Reachability
ISSN:	0890-5401, 1090-2651
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!