Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Eager Markov Chains Parosh Aziz Abdulla
 

Summary: Eager Markov Chains
Parosh Aziz Abdulla
Uppsala University, Sweden.
parosh@it.uu.se
Noomene Ben Henda
Uppsala University, Sweden.
Noomene.BenHenda@it.uu.se
Richard Mayr
NC State University, USA.
mayr@csc.ncsu.edu
Sven Sandberg
Uppsala University, Sweden.
svens@it.uu.se
Abstract
We consider infinite­state discrete Markov chains which are
eager: the probability of avoiding a defined set of final
states for more than n steps decreases exponentially in n.
We study the problem of computing the expected reward
(or cost) of runs until reaching the final states, where re­
wards are assigned to individual runs by computable re­

  

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences