Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying random variables may have heavy tailed distributions, that is, their tail distribution decays at a subexponential rate. We consider one class of such problems that has applications in… (More)
The opinions expressed here are our own, and do not reflect the views of the Board of Governors or its staff.
We consider the risk of a portfolio comprised of loans, bonds, and financial instruments that are subject to possible default. In particular, we are interested in performance measures such as the probability that the portfolio incurs large losses over a fixed time horizon and the expected excess loss given that large losses are incurred during this horizon.… (More)
We consider the eecient estimation, via simulation, of very low buuer overrow probabilities in certain acyclic ATM queueing networks. We apply the theory of eeective bandwidths and Markov additive processes to derive an asymptotically optimal simulation scheme for estimating such probabilities for a single queue with multiple independent sources, each of… (More)
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studied in the literature in an approximate mathematical framework under the assumption that the underlying random variables have a Gaussian distribution. We use the large deviations… (More)
In this introductory tutorial we discuss the problem of pricing financial derivatives, the key application of Monte Carlo in finance. We review the mathematics that uses no-arbitrage principle to price derivatives and expresses derivatives price as an expectation under the equivalent martingale measure. In the presentation at the conference we will also… (More)
We consider the non-cooperative choice of arrival times by individual users, who seek service at a first-come first-served queueing system that opens up at a given time. Each user wishes to obtain service as early as possible, while minimizing the expected wait in the queue. This problem was recently studied within a simplified fluid-scale model. Here we… (More)