Skip to main content

Continuous-Time Dynamic Reward Structures

  • Conference paper
Operations Research Proceedings 1995

Part of the book series: Operations Research Proceedings ((ORP,volume 1995))

  • 215 Accesses

Summary

This article studies the extension of continuous-time Markov reward processes to general dynamic reward structures governed by matrices with nonnegative off-diagonal elements. We show that several results for the standard Markov case also carry over to this more general case, most notably: uniformization, error bound analysis and comparison results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berman, A., Plemmons, R. J.: Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York 1979

    Google Scholar 

  2. Grassman, W.: Finding transient solutions in Markovian event systems through randomization. In: Numerical Solution of Markov Chains (W. J. Stewart, ed.), Marcel Dekker, New York 1991, pp. 375–385

    Google Scholar 

  3. Gross, D., Miller, D. R.: The randomization technique as a modelling tool and solution procedure for transient Markov processes. Oper. Res. 32 (1984) 343–361

    Article  Google Scholar 

  4. Van Dijk N.M.: Approximate uniformization for continuous-time Markov chains with an application of perform ability analysis. Stoch. Proc. Appl. 40 (1989) 339–357

    Article  Google Scholar 

  5. Van Dijk, N.M.: The importance of bias terms for error bounds and comparison results. In: Numerical Solution of Markov Chains (W. J. Stewart, ed.), Marcel Dekker, New York 1991

    Google Scholar 

  6. Van Dijk, N.M., Lamond, B. F.: Simple bounds for exponential finite tandem queues. Oper. Res. 36 (1988) 470–477

    Article  Google Scholar 

  7. Van Dijk, N.M., Puterman, M.L.: Perturbation theory for Markov reward processes with applications to queueing systems. Adv. Appl. Prob. 20 (1988) 79–98

    Article  Google Scholar 

  8. Melamed, B., Yadin, M.: Randomization procedures in the computation of cumulative-time distributions over discrete state Markov processes. Oper. Res. 32 (1984) 926–943

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Dijk, N.M., Sladký, K. (1996). Continuous-Time Dynamic Reward Structures. In: Kleinschmidt, P., Bachem, A., Derigs, U., Fischer, D., Leopold-Wildburger, U., Möhring, R. (eds) Operations Research Proceedings 1995. Operations Research Proceedings, vol 1995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80117-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-80117-4_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60806-6

  • Online ISBN: 978-3-642-80117-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics