Chatterjee, Krishnendu ;
Joglekar, Manas ;
Shah, Nisarg
Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives
Abstract
We consider Markov decision processes (MDPs) with specifications given as Büchi (liveness) objectives. We consider the problem of computing the set of almostsure winning vertices from where the objective can be ensured with probability 1. We study for the first time the average case complexity of the classical algorithm for computing the set of almostsure winning vertices for MDPs with Buchi objectives. Our contributions are as follows:
First, we show that for MDPs with constant outdegree the expected number of iterations is at most logarithmic and the average case running time is linear (as compared to the worst case linear number of iterations and quadratic time complexity). Second, for the average case analysis over all MDPs we show that the expected number of iterations is constant and the average case running time is linear (again as compared to the worst case linear number of iterations and
quadratic time complexity). Finally we also show that given that all MDPs are equally likely, the probability that the classical algorithm requires more than constant number of iterations is exponentially small.
BibTeX  Entry
@InProceedings{chatterjee_et_al:LIPIcs:2012:3881,
author = {Krishnendu Chatterjee and Manas Joglekar and Nisarg Shah},
title = {{Average Case Analysis of the Classical Algorithm for Markov Decision Processes with B{\"u}chi Objectives}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) },
pages = {461473},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783939897477},
ISSN = {18688969},
year = {2012},
volume = {18},
editor = {Deepak D'Souza and Telikepalli Kavitha and Jaikumar Radhakrishnan},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3881},
URN = {urn:nbn:de:0030drops38817},
doi = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2012.461},
annote = {Keywords: MDPs, Buchi objectives, Average case analysis}
}
2012
Keywords: 

MDPs, Buchi objectives, Average case analysis 
Seminar: 

IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)

Related Scholarly Article: 


Issue date: 

2012 
Date of publication: 

2012 