非确定性序列决策过程的超强表示定理

Q4 Decision Sciences Journal of the Operations Research Society of Japan Pub Date : 2017-04-20 DOI:10.15807/JORSJ.60.136

Yukihiro Maruyama

{"title":"非确定性序列决策过程的超强表示定理","authors":"Yukihiro Maruyama","doi":"10.15807/JORSJ.60.136","DOIUrl":null,"url":null,"abstract":"This paper studies the relation between a given nondeterministic discrete decision process (ndddp) and a nondeterministic sequential decision process (nd-sdp), which is a finite nondeterministic automaton with a cost function, and its subclasses (nd-msdp, nd-pmsdp, nd-smsdp). We show super-strong representation theorems for nd-sdp and its subclasses, for which the functional equations of nondeterministic dynamic programming are obtainable. The super-strong representation theorems provide necessary and sufficient conditions for the existence of the nd-sdp and its subclasses with the same set of feasible policies and the same cost value for every feasible policy as the given process nd-ddp.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"60 1","pages":"136-155"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.60.136","citationCount":"0","resultStr":"{\"title\":\"SUPER-STRONG REPRESENTATION THEOREMS FOR NONDETERMINISTIC SEQUENTIAL DECISION PROCESSES\",\"authors\":\"Yukihiro Maruyama\",\"doi\":\"10.15807/JORSJ.60.136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies the relation between a given nondeterministic discrete decision process (ndddp) and a nondeterministic sequential decision process (nd-sdp), which is a finite nondeterministic automaton with a cost function, and its subclasses (nd-msdp, nd-pmsdp, nd-smsdp). We show super-strong representation theorems for nd-sdp and its subclasses, for which the functional equations of nondeterministic dynamic programming are obtainable. The super-strong representation theorems provide necessary and sufficient conditions for the existence of the nd-sdp and its subclasses with the same set of feasible policies and the same cost value for every feasible policy as the given process nd-ddp.\",\"PeriodicalId\":51107,\"journal\":{\"name\":\"Journal of the Operations Research Society of Japan\",\"volume\":\"60 1\",\"pages\":\"136-155\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.15807/JORSJ.60.136\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Operations Research Society of Japan\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15807/JORSJ.60.136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Decision Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Operations Research Society of Japan","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15807/JORSJ.60.136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Decision Sciences","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了一个给定的不确定离散决策过程（ndddp）与一个不确定序列决策过程（nd sdp）及其子类（nd msdp，nd pmsdp，nd smsdp）之间的关系。给出了nd-sdp及其子类的超强表示定理，得到了不确定动态规划的函数方程。超强表示定理为具有与给定过程nd-ddp相同的可行策略集和每个可行策略的相同代价值的nd-sdp及其子类的存在提供了充要条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

SUPER-STRONG REPRESENTATION THEOREMS FOR NONDETERMINISTIC SEQUENTIAL DECISION PROCESSES

This paper studies the relation between a given nondeterministic discrete decision process (ndddp) and a nondeterministic sequential decision process (nd-sdp), which is a finite nondeterministic automaton with a cost function, and its subclasses (nd-msdp, nd-pmsdp, nd-smsdp). We show super-strong representation theorems for nd-sdp and its subclasses, for which the functional equations of nondeterministic dynamic programming are obtainable. The super-strong representation theorems provide necessary and sufficient conditions for the existence of the nd-sdp and its subclasses with the same set of feasible policies and the same cost value for every feasible policy as the given process nd-ddp.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of the Operations Research Society of Japan 管理科学-运筹学与管理科学

CiteScore

0.70

自引率

0.00%

发文量

审稿时长

12 months

期刊介绍： The journal publishes original work and quality reviews in the field of operations research and management science to OR practitioners and researchers in two substantive categories: operations research methods; applications and practices of operations research in industry, public sector, and all areas of science and engineering.