Skip to main content
Log in

Maximal coupling and rare perturbation sensitivity analysis

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

In this article, we introduce a new method for obtaining the ersatz sample derivatives useful in sensitivity analysis: the maximal coupling RPA method.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. F. Baccelli and P. Brémaud, Virtual customers in sensitivity and light traffic analysis via Campbell's formula for point processs, Adv. Appl. Prob. (1992), to appear.

  2. P. Brémaud,Point Processes and Queues (Springer, 1981).

  3. P. Brémaud and F. Vázquez-Abad, On the pathwise computation of derivatives with respect to the rate of a point process: The phantom RPA method, Queueing Systems 10(1992)249–270.

    Google Scholar 

  4. L. Devroye, Coupled samples in simulation, Oper. Res. 38(1990)115–126.

    Google Scholar 

  5. P. Glasserman,Gradient Estimation via Perturbation Analysis (Kluwer, Boston, 1990).

    Google Scholar 

  6. P. Glynn, Likelihood ratio gradient estimation: An overview,Proc. 1989 Winter Simulation Conf., ed. A. Thesen, H. Grant and W.D. Kelton (1989), pp. 366–374.

  7. W.B. Gong, Smoothed perturbation analysis algorithm for aG/G/I routing problem, in:Proc. 1988 Winter Simulation Conf., ed. M. Abrams, P. Haigh and J. Comfort (1988), pp. 525–531.

  8. W.B. Gong and Y.C. Ho, Smoothed perturbation analysis of discrete events dynamical systems, IEEE Trans. Auto. Control AC-10(1987)858–866.

    Google Scholar 

  9. K. Konstantopoulos and M. Zazanis, Stationary IPA estimates, Preprint (1990).

  10. J. Pitman, Uniform rates of convergence for Markov chain transition probabilities, Z. W. 29(1974)193–227.

    Google Scholar 

  11. M.I. Reiman and A. Weiss, Sensitivity analysis for simulations via likelihood ratios, Oper. Res. 37(1989)830–844.

    Google Scholar 

  12. M.I. Reiman and B. Simon, Open queueing systems in light traffic, Math. Oper. Res. 14(1989)26–59.

    Google Scholar 

  13. R. Rubinstein, Sensitivity analysis and performance extrapolation for computer simulation models, Oper. Res. 37(1989)72–81.

    Google Scholar 

  14. H. Scheffé, A useful convergence theorem for probability distributions, Ann. Math. Stat. 18(1947)434–458.

    Google Scholar 

  15. B. Simon, A new estimation of sensitivity measures for simulation based on light traffic theory, ORSA J. Comp. 1(1989)172–180.

    Google Scholar 

  16. R. Suri, Perturbation analysis: The state of the art and research issues explained via theGI/GI/1 queue, Proc. IEEE 77(1989)114–137.

    Google Scholar 

  17. R. Suri and M. Zazanis, Perturbation analysis gives strongly consistent sensitivity estimates for theM/G/1 queues. Manag. Sci. 34(1988)39–64.

    Google Scholar 

  18. H. Van Trees,Detection, Estimation and Modulation Theory (Van Nostrand, 1968).

  19. W. Whitt, Bivariate distributions with given marginals, Ann. Stat. 4(1976)1280–1289.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brémaud, P. Maximal coupling and rare perturbation sensitivity analysis. Queueing Syst 11, 307–333 (1992). https://doi.org/10.1007/BF01163859

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01163859

Keywords

Navigation