Strong representation theorems for bitone sequential decision processes

DOI10.1080/1055678031000154707MaRDI QIDQ4664049zbMATH OpenOpenAlexFDO

Authors Yukihiro Maruyama

Publication date 5 April 2005

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/1055678031000154707

zbMATH Keywords

bitone sequential processdiscrete decision processdynamic programmingstrong representation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 6103381
• scientific article; zbMATH DE number 5910584
• STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS
• Super-strong representation theorems for nondeterministic sequential decision processes
• A representation theorem for a decision theory with conditionals
• Axioms for a Class of Algorithms of Sequential Decision Making
• Strong 1-optimal stationary policies in denumerable Markov decision processes
• The existence of strongly computable representations in the class of Boolean algebras
• Bisimulations and logical characterizations on continuous-time Markov decision processes
• Decision problems, complexity, traces, and representations

Cited in

(2)

• STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS
• Super-strong representation theorems for nondeterministic sequential decision processes

This page was built for publication: Strong representation theorems for bitone sequential decision processes

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