Multi-objective Discounted Reward Verification in Graphs and MDPs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00072859" target="_blank" >RIV/00216224:14330/13:00072859 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-45221-5_17" target="_blank" >http://dx.doi.org/10.1007/978-3-642-45221-5_17</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-45221-5_17" target="_blank" >10.1007/978-3-642-45221-5_17</a>

Result language
angličtina
Original language name
Multi-objective Discounted Reward Verification in Graphs and MDPs
Original language description
We study the problem of achieving a given value in Markov decision processes (MDPs) with several independent discounted reward objectives. We consider a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at different and variable rates. We establish results for twoprominent subclasses of the problem, namely state-discount models where the discount factors are only dependent on the state of the MDP (and independent of the objective), and reward-discount models where they are only dependent on the objective (but not on the state of the MDP). For the state-discount models we use a straightforward reduction to expected total reward and show that the problem whether a value is achievable can be solved in polynomial time.
Czech name
—
Czech description
—

Project
<a href="/en/project/LG13010" target="_blank" >LG13010: Czech Republic representation in the European Research Consortium for Informatics and Mathematics (ERCIM)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Logic for Programming, Artificial Intelligence, and Reasoning
ISBN
9783642452208
ISSN
0302-9743
e-ISSN
—
Number of pages
15
Pages from-to
228-242
Publisher name
Springer
Place of publication
Berlin, Heidelberg
Event location
Stellenbosch, South Africa
Event date
Jan 1, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)