BROŽEK, Václav, Tomáš BRÁZDIL, Krishnendu CHATTERJEE, Vojtěch FOREJT and Antonín KUČERA. Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. In Martin Grohe. Proceedings 26th Annual IEEE Symposium on Logic in Computer Science. Los Alamitos, California: IEEE, 2011, p. 33-42. ISBN 978-0-7695-4412-0. Available from: https://dx.doi.org/10.1109/LICS.2011.10.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
Authors BROŽEK, Václav (203 Czech Republic, belonging to the institution), Tomáš BRÁZDIL (203 Czech Republic, belonging to the institution), Krishnendu CHATTERJEE (356 India), Vojtěch FOREJT (203 Czech Republic, belonging to the institution) and Antonín KUČERA (203 Czech Republic, guarantor, belonging to the institution).
Edition Los Alamitos, California, Proceedings 26th Annual IEEE Symposium on Logic in Computer Science, p. 33-42, 10 pp. 2011.
Publisher IEEE
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
RIV identification code RIV/00216224:14330/11:00051963
Organization unit Faculty of Informatics
ISBN 978-0-7695-4412-0
Doi http://dx.doi.org/10.1109/LICS.2011.10
UT WoS 000297350400006
Keywords in English Markov decision process; optimization with multiple objectives; mean payoff; Pareto curve; approximation
Tags International impact, Reviewed
Changed by Changed by: RNDr. Vojtěch Forejt, Ph.D., LL.B. (Hons), učo 99155. Changed: 12/4/2013 01:40.
Abstract
We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with k reward functions, in the expectation objective the goal is to maximize the expected value, and in the satisfaction objective the goal is to maximize the probability of runs such that the limit-average value stays above a given vector.
Abstract (in Czech)
V článku jsou studovány Markovovy rozhodovací procesy s několika limit-average funkcemi. Uvažují se dva typy výherních podmínek a pro obě jsou podány základní výsledky o rozhodnutelnosti a složitosti příslušných rozhodovacích problémů.
Links
P202/10/1469, interní kód MUName: Formální metody pro analýzu a verifikaci komplexních systémů
1M0545, research and development projectName: Institut Teoretické Informatiky
Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science
PrintDisplayed: 19/5/2024 12:49