Art

J-GLOBAL ID：201702233284189940   Reference number：17A0777003

SUPER-STRONG REPRESENTATION THEOREMS FOR NONDETERMINISTIC SEQUENTIAL DECISION PROCESSES

非決定論的逐次決定プロセスに関する超強力な表現定理

Author (1)： Maruyama Yukihiro (Nagasaki University)
Material： Journal of the Operations Research Society of Japan  (日本オペレーションズ・リサーチ学会論文誌)
Volume： 60  Issue： 2  Page： 136-155(J-STAGE)  Publication year： 2017 
JST Material Number： G0402A  ISSN： 0453-4514  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *dynamic programming ,  nondeterminism ,  process (production) ,  *nondeterministic automaton ,  functional equation ,  decision process
Semi thesaurus term： 非決定論 ,  非決定論的逐次決定プロセス

Author keywords (4)： Dynamic programming ,  nondeterministic automaton ,  nondeterministic sequential decision process ,  super-strong representation theorem

JST classification (1)： Basic mathematical theory of operations research  (KA03020B)

Reference (8)：

• [1] T. Ibaraki: Representation theorems for equivalent optimization problems. Information and Control, 21 (1972), 397-435.
• [2] T. Ibaraki: Finite automata having cost functions: Nondeterministic models. Information and Control, 37 (1978), 40-69.
• [3] S. Iwamoto: From dynamic programming to bynamic programming. Journal of Mathematical Analysis and Applications, 177 (1993), 56-74.
• [4] R.M. Karp and M. Held: Finite-state processes and dynamic programming. SIAM Journal on Applied Mathematics, 15 (1967), 693-718.
• [5] A. Lew: Nondeterministic dynamic programming on a parallel coprocessing system. Applied Mathematics and Computation, 120 (2001), 139-147.

Terms in the title (4)： 逐次 ,  プロセス ,  表現 ,  定理