Abstract
This paper provides sufficient conditions when certain information about the past of a stochastic decision processes can be ignored by a controller. We illustrate the results with particular applications to queueing control, control of semi-Markov decision processes with iid sojourn times, and uniformization of continuous-time Markov decision processes.
Similar content being viewed by others
References
Balachandran KR (1973) Control policies for a single server system. Manage Sci 19:1013–1018
Bertesekas DP (2001) Dynamic programming and optimal control, 2nd edin. Scientific, Belmont MA
Bertsekas DP, Shreve SE (1978) Stochastic optimal control: The discrete-time case. Academic, New York (republished by Athena Scientific, Belmont, MA 1997)
Cassandras CG (1993) Discrete event systems: modeling and performance analysis. IRWIN, Boston
Dynkin EB, Yushkevich AA (1979) Controlled Markov processes. Springer, Berlin Heidelberg New York
Fan-Orzechowski X, Feinberg EA (2004) Optimality of Randomized trunk reservation for a problem with a single constraint. Department of Applied Mathematics and Statistics, SUNY at Stony Brook, http://www.ams.sunysb.edu/∼feinberg/public/FanFeinberg1.pdf
Feinberg EA (2004) Continuous-time discounted jump-Markov decision processes: a discrete-event approach. Math Oper Res 29:492–524
Feinberg EA, Kella O (2002) Optimality of D-policies for an M/G/1 queue. Queueing Syst 42:355–376
Feinberg EA, Reiman MI (1994) Optimality of randomized trunk reservation. Prob Eng Informa Sci 8:463–489
Feinberg EA, Shwartz A. ed. (2002) Handbook of Markov decision processes. Kluwer, Boston
Fristedt B, Gray L (1997) A modern approach to probability theory. Birkhäuser, Boston
Gut A (1988) Stopped random walks. Limit theorems and applications. Springer, Berlin Heidelberg New York
Hinderer K (1970) Foundations of non-stationary dynamic programming with discrete time paramerter. Springer, Berlin Heidelberg New York
Hordijk A (1974) Dynamic programming and Markov potential theory. Mathematical centre tracts 51, Amsterdam
Kitayev MY (1985) Semi-Markov and jump Markov controlled models: average cost criterion. SIAM Theory Probab. Appl. 30:272-288
Kitayev MY Rykov VV (1995) Controlled queueing systems. CRC, New York
Koole G (2005) Routing to parallel homogeneous queues. Math Methods Oper Res, (this issue)
Lippman SA (1975) Applying a new device in the optimization of exponential queueing systems. Oper Res 23:687-710
Miller BL (1969) A queueing reward system with several customer classes. Manage Sci 16:235-245
Puterman ML (1994) Markov decision processes. Wiley, New York
Sennott LI (1999) Stochastic dynamic programming and the control of queueing systems. Wiley, New York
Author information
Authors and Affiliations
Corresponding author
Additional information
Mathematics Subject Classification (2000): Primary 60K25, Secondary 90C40
Rights and permissions
About this article
Cite this article
Feinberg, E.A. On essential information in sequential decision processes. Math Meth Oper Res 62, 399–410 (2005). https://doi.org/10.1007/s00186-005-0035-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-005-0035-3