Academic Commons

Theses Doctoral

Exact Simulation Techniques in Applied Probability and Stochastic Optimization

Pei, Yanan

This dissertation contains two parts. The first part introduces the first class of perfect sampling algorithms for the steady-state distribution of multi-server queues in which the arrival process is a general renewal process and the service times are independent and identically distributed (iid); the first-in-first-out FIFO GI/GI/c queue with 2 <= c < 1. Two main simulation algorithms are given in this context, where both of them are built on the classical dominated coupling from the past (DCFTP) protocol. In particular, the first algorithm uses a coupled multi-server vacation system as the upper bound process and it manages to simulate the vacation system backward in time from stationarity at time zero. The second algorithm utilizes the DCFTP protocol as well as the Random Assignment (RA) service discipline. Both algorithms have finite expected termination time with mild moment assumptions on the interarrival time and service time distributions. Our methods are also extended to produce exact simulation algorithms for Fork-Join queues and infinite server systems.
The second part presents general principles for the design and analysis of unbiased Monte Carlo estimators in a wide range of settings. The estimators possess finite work-normalized variance under mild regularity conditions. We apply the estimators to various applications including unbiased steady-state simulation of regenerative processes, unbiased optimization in Sample Average Approximations and distribution quantile estimation.


  • thumnail for Pei_columbia_0054D_14897.pdf Pei_columbia_0054D_14897.pdf application/pdf 1.58 MB Download File

More About This Work

Academic Units
Industrial Engineering and Operations Research
Thesis Advisors
Blanchet, Jose H.
Ph.D., Columbia University
Published Here
October 9, 2018