Probabilistic Systems with LimSup and LimInf Objectives
| dc.creator | Chatterjee, Krishnendu | |
| dc.creator | Henzinger, Thomas A. | |
| dc.date | 2008-09-09 | |
| dc.date.accessioned | 2026-07-07T10:01:40Z | |
| dc.date.available | 2026-07-07T10:01:40Z | |
| dc.description | We give polynomial-time algorithms for computing the values of Markov decision processes (MDPs) with limsup and liminf objectives. A real-valued reward is assigned to each state, and the value of an infinite path in the MDP is the limsup (resp. liminf) of all rewards along the path. The value of an MDP is the maximal expected value of an infinite path that can be achieved by resolving the decisions of the MDP. Using our result on MDPs, we show that turn-based stochastic games with limsup and liminf objectives can be solved in NP \cap coNP. | |
| dc.description | The paper will appear in ILC proceedings | |
| dc.identifier | https://arxiv.org/abs/0809.1465 | |
| dc.identifier | http://arxiv.org/abs/0809.1465 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/168708 | |
| dc.subject | Computer Science and Game Theory | |
| dc.subject | Logic in Computer Science | |
| dc.title | Probabilistic Systems with LimSup and LimInf Objectives | |
| dc.type | text |