检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:温馨 徐小雅 郭先平[3] WEN Xin;XU Xiaoya;GUO Xianping(School of Business,Sun Yat-sen University,Guangzhou,510275,China;School of Business Administration,Guangdong University of Finance&Economics,Guangzhou,510320,China;School of Mathematics,Sun Yat-sen University,Guangzhou 510275,China)
机构地区:[1]中山大学管理学院,广州510275 [2]广东财经大学工商管理学院,广州510320 [3]中山大学数学学院,广州510275
出 处:《应用概率统计》2023年第4期589-603,共15页Chinese Journal of Applied Probability and Statistics
基 金:The research was supported by the National Natural Science Foundation of China(Grant Nos.11931018,72101059);Guangdong Natural Science Foundation(Grant No.2020A1515010924).
摘 要:本文研究一类非平稳离散马氏决策过程的风险概率最小化问题,其中转移概率和奖励函数随时间变化.与现有文献中的期望报酬/成本准则不同,本文考虑最小化系统在首次到达某个目标集之前获得的总报酬未能达到给定利润目标的概率.在合理的假设条件下,我们建立了相应的最优方程序列,验证了最优风险函数序列是最优方程序列的唯一解,并证明了最优马氏策略的存在性.This paper considers a risk probability minimization problem for nonstationary discrete-time Markov decision processes,in which the transition probabilities and the reward functions depend on time.Different from the expected reward/cost criteria in the existing literature,the optimality performance here is to minimize the probability that the total rewards do not reach a given profit goal until the first passage time to some target set.Under mild reasonable conditions,we establish the corresponding optimality equations,verify that the sequence of the optimal risk functions is the unique solution to the optimality equations,and prove the existence of an optimal Markov policy.
关 键 词:非平稳离散马氏决策过程 风险概率准则 最优方程序列 首达时间 最优马氏策略
分 类 号:O211.62[理学—概率论与数理统计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.147.67.34