Super-strong representation theorems for nondeterministic sequential decision processes

DOI10.15807/JORSJ.60.136MaRDI QIDQ5365658zbMATH OpenOpenAlexFDO

Authors Yukihiro Maruyama

Publication date 6 October 2017

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.60.136

zbMATH Keywords

dynamic programmingnondeterministic automatonnondeterministic sequential decision processsuper-strong representation theorem

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Dynamic programming (90C39)

Recommendations

• Strong representation theorems for bitone sequential decision processes
• STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS
• scientific article; zbMATH DE number 5148988
• On nondeterministic dynamic programming
• Finite-stage stochastic decision processes with recursive reward structure I: optimality equations and deterministic strategies

Cited in

(2)

• STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS
• Strong representation theorems for bitone sequential decision processes

This page was built for publication: Super-strong representation theorems for nondeterministic sequential decision processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365658)