The complexity of solving reachability games using value and strategy iteration

DOI10.1007/S00224-013-9524-6MaRDI QIDQ6828177zbMATH OpenFDO

Authors Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen

Publication date 5 February 2015

Published in Theory of Computing Systems (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithmsvalue iterationstrategy iterationconcurrent reachability games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

This page was built for publication: The complexity of solving reachability games using value and strategy iteration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828177)