When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2011.399
URN: urn:nbn:de:0030-drops-33547
URL: https://drops.dagstuhl.de/opus/volltexte/2011/3354/
 Go to the corresponding LIPIcs Volume Portal

### Efficient Approximation of Optimal Control for Continuous-Time Markov Games

 pdf-format:

### Abstract

We study the time-bounded reachability problem for continuous time Markov decision processes (CTMDPs) and games (CTMGs). Existing techniques for this problem use discretization techniques to break time into discrete intervals, and optimal control is approximated for each interval separately. Current techniques provide an accuracy of O(\epsilon^2) on each interval, which leads to an infeasibly large number of intervals. We propose a sequence of approximations that achieve accuracies of O(\epsilon^3), O(\epsilon^4), and O(\epsilon^5), that allow us to drastically reduce the number of intervals that are considered. For CTMDPs, the resulting algorithms are comparable to the heuristic approach given by Buckholz and Schulz, while also being theoretically justified. All of our results generalise to CTMGs, where our results yield the first practically implementable algorithms for this problem. We also provide positional strategies for both players that achieve similar error bounds.

### BibTeX - Entry

@InProceedings{fearnley_et_al:LIPIcs:2011:3354,
author =	{John Fearnley and Markus Rabe and Sven Schewe and Lijun Zhang},
title =	{{Efficient Approximation of Optimal Control for Continuous-Time Markov Games}},
booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages =	{399--410},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-939897-34-7},
ISSN =	{1868-8969},
year =	{2011},
volume =	{13},
editor =	{Supratik Chakraborty and Amit Kumar},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},