STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS
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).
Year of publication: |
2007
|
---|---|
Authors: | MARUYAMA, YUKIHIRO |
Published in: |
Asia-Pacific Journal of Operational Research (APJOR). - World Scientific Publishing Co. Pte. Ltd., ISSN 1793-7019. - Vol. 24.2007, 02, p. 181-202
|
Publisher: |
World Scientific Publishing Co. Pte. Ltd. |
Subject: | Dynamic programming | discrete decision process | bitone sequential decision process | strong representation | finite automaton |
Saved in:
Saved in favorites
Similar items by subject
-
Dynamic labour demand with lumpy and kinked adjustment costs
Rota, Paola, (2001)
-
Identification of Dynamic Discrete Choice Models
Abbring, Jaap H., (2010)
-
Reputation with long run players and imperfect observation
Atakan, Alp E., (2009)
- More ...
Similar items by person