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...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 285; p. 104886
Main Authors:	Eisentraut, Julia, Kelmendi, Edon, Křetínský, Jan, Weininger, Maximilian
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.05.2022
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!