The Splitting Method for Decision Making

References

• Asmussen , S. , Glynn , P. W. ( 2007 ). Stochastic Simulation: Algorithms and Analyses. Springer .
   Google Scholar
• Baumert , S. , Ghate , A. , Kiatsupaibul , S. , Shen , Y. , Smith , R. L. , Zabinsky , Z. B. ( 2009 ). Discrete hit-and-run for sampling points from arbitrary distributions over subsets of integer hyper-rectangles . Operations Research.
   Web of Science ®Google Scholar
• Botev , Z. I. , Kroese , D. P. ( 2008 ). An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting . Methodology and Computing in Applied Probability.
   Web of Science ®Google Scholar
• Garvels , M. J. J. ( 2000 ). The Splitting Method in Rare-Event Simulation. Ph.D. thesis, University of Twente .
   Google Scholar
• Garvels , M. J. J. , Rubinstein , R. Y. ( 2002 ). A combined splitting – cross entropy method for rare event probability estimation of single queues and ATM networks. Unpublished Manuscript .
   Google Scholar
• Gryazina , E. , Polyak , B. ( 2009 ). Randomized Methods Based on new Monte Carlo schemes for control and optimizations . Annals of Operations Research.
   Web of Science ®Google Scholar
• Lagnoux-Renaudie , A. ( 2010 ). A two-steps branching splitting model under cost constraint. To appear in Journal of Applied Probability.
   Google Scholar
• L'Ecuyer , P. , Demers , V. , Tuffin , B. ( 2007 ). Rare-events, cloning, and quasi-Monte Carlo . ACM Transactions on Modeling and Computer Simulation 17 : 2 .
   Web of Science ®Google Scholar
• Melas , V. B. ( 1997 ). On the Efficiency of the Splitting and Roulette Approach for Sensitivity Analysis. Winter Simulation Conference, Atlanta, Georgia, pp. 269–274 .
   Google Scholar
• Motwani , R. , Raghavan , R. ( 1997 ). Randomized Algorithms. Cambridge University Press .
   Google Scholar
• Ross , S. M. ( 2006 ). Simulation . New York : Wiley .
   Google Scholar
• Rubinstein , R. Y. ( 1999 ). The cross-entropy method for combinatorial and continuous optimization . Methodology and Computing in Applied Probability 1 : 127 – 190 .
   Google Scholar
• Rubinstein , R. Y. (2009). The Gibbs cloner for combinatorial optimization, counting and sampling. Methodology and Computing in Applied Probability 11:491–549.
   Web of Science ®Google Scholar
• Rubinstein , R. Y. ( 2010 ). Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work . Methodology and Computing in Applied Probability 12 : 1 – 50 .
   Web of Science ®Google Scholar
• Rubinstein , R. Y. , Kroese , D. P. ( 2004 ). The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning. Springer .
   Google Scholar
• Rubinstein , R. Y. , Kroese , D. P. ( 2007 ). Simulation and the Monte Carlo Method. , 2nd ed. New York : Wiley .
   Google Scholar