PDF4PRO ⚡AMP

Modern search engine that looking for books and documents around the web

Example: air traffic controller

1 Stopping Times - Columbia University

Copyrightc 2009 by Karl Sigman1 Stopping Stopping Times : DefinitionGiven a stochastic processX={Xn:n 0}, arandom time is a discrete random variableon the same probability space asX, taking values in the time set IN ={0,1,2,..}.X denotesthe state at the random time ; if =n, thenX =Xn. If we were to observe the valuesX0,X1,.., sequentially in time and then stop doing so right after some timen, basing ourdecision to stop on (at most) only what we have seen thus far, then we have the essence ofastopping time.

1. (First passage/hitting times/Gambler’s ruin problem:) Suppose that X has a discrete state space and let ibe a xed state. Let ˝= minfn 0 : X n= ig: This is called the rst passage time of the process into state i. Also called the hitting time of the process to state i. More generally we can let Abe a collection of states such

Tags:

  University, Columbia university, Columbia, Gamblers, Ruin, Gambler s ruin

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Spam in document Broken preview Other abuse

Transcription of 1 Stopping Times - Columbia University

Related search queries