STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS

Yukihiro Maruyama ()
Additional contact information
Yukihiro Maruyama: Department of General Economics, Faculty of Economics, Nagasaki University, 4-2-1, Katafuchi, Nagasaki 850-8506, Japan

Asia-Pacific Journal of Operational Research (APJOR), 2007, vol. 24, issue 02, 181-202

Abstract: In this paper, we will introduce a new subclass of bitone sequential decision process (bsdp) and give a representation theorem for the subclass called positively/negatively bsdp, shortly, p/n bsdp, that is, necessary and sufficient condition for p/n bsdp to strongly represent a given discrete decision process (ddp).

Keywords: Dynamic programming; discrete decision process; bitone sequential decision process; strong representation; finite automaton (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595907001218
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:24:y:2007:i:02:n:s0217595907001218

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595907001218

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().