By Ger Koole, Department of Mathematics, VU University Amsterdam, The Netherlands, koole@few.vu.nl
This paper focuses on monotonicity results for dynamic systems that take values in the natural numbers or in more-dimensional lattices. The results are mostly formulated in terms of controlled queueing systems, but there are also applications to maintenance systems, revenue management, and so forth. We concentrate on results that are obtained by inductively proving properties of the dynamic programming value function. We give a framework for using this method that unifies results obtained for different models. We also give a comprehensive overview of the results that can be obtained through it, in which we discuss not only (partial) characterizations of optimal policies but also applications of monotonicity to optimization problems and the comparison of systems.
Monotonicity in Markov Reward and Decision Chains: Theory and Applications focuses on monotonicity results for dynamic systems that take values in the natural numbers or in more-dimensional lattices. The results are mostly formulated in terms of controlled queueing systems, but there are also applications to maintenance systems, revenue management, and so forth. The focus is on results that are obtained by inductively proving properties of the dynamic programming value function. A framework is provided for using this method that unifies results obtained for different models. The author also provides a comprehensive overview of the results that can be obtained through it, in which he discusses not only (partial) characterizations of optimal policies but also applications of monotonicity to optimization problems and the comparison of systems. Monotonicity in Markov Reward and Decision Chains: Theory and Applications is an invaluable resource for anyone planning or conducting research in this particular area. The essentials of the topic are presented in an accessible manner and an extensive bibliography guides towards further reading.