具有LimSup和LimInf目标的概率系统
Probabilistic Systems with LimSup and LimInf Objectives
摘要：
我们给多项式时间算法计算马尔可夫决策过程（MDP）与limsup和liminf目标的值。一个实值的奖励被分配给每个状态，并且MDP中的无限路径的值是limsup（resp. MDP的值是可以通过解析MDP的决策来实现的无限路径的最大期望值。使用我们的结果MDP，我们表明，回合制随机游戏limsup和liminf目标可以解决NP \cap coNP。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
