PREFACE TO THE SPECIAL ISSUE ON MATHEMATICAL DECISION MAKING UNDER UNCERTAINTY

• Ano Katsunori

  Guest Editor

• Maruyama Yukihiro

  Guest Editor

Bibliographic Information

Other Title

• SUPER-STRONG REPRESENTATION THEOREMS FOR NONDETERMINISTIC SEQUENTIAL DECISION PROCESSES

Abstract

This paper studies the relation between a given nondeterministic discrete decision process (nd-ddp) 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

• Journal of the Operations Research Society of Japan

  Journal of the Operations Research Society of Japan 60 (2), 43-43, 2017

  The Operations Research Society of Japan

Keywords

• Dynamic programming
• nondeterministic automaton
• nondeterministic sequential decision process
• super-strong representation theorem

Details

• CRID: 1390282679086930944
• NII Article ID: 130005633863
• NII Article ID: 130005633866
• NII Book ID: AA00703935
• DOI: 10.15807/jorsj.60.43
• DOI: 10.15807/jorsj.60.136
• ISSN: 21888299
• ISSN: 04534514
• NDL BIB ID: 028154560
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I028154560
• Web Site: https://www.jstage.jst.go.jp/article/jorsj/60/2/60_43/_pdf
• Web Site: https://www.jstage.jst.go.jp/article/jorsj/60/2/60_136/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed