Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Consider the gambler's ruin problem where on each bet the gambler either wins 1 with probability \(p\) or loses 1 with probability \(1-p\). The gambler will continue to play until his winnings are either \(N-i\) or \(-i\). (That is, starting with \(i\) the gambler will quit when his fortune reaches either \(N\) or \(0 .\) ) Let \(T\) denote the number of bets made before the gambler stops. Use Wald's equation, along with the known probability that the gambler's final winnings are \(N-i\), to find \(E[T]\). Hint: Let \(X_{j}\) be the gambler's winnings on bet \(j, j \geqslant 1\). What are the possible values of \(\sum_{j=1}^{T} X_{j} ?\) What is \(E\left[\sum_{j=1}^{T} X_{j}\right]\) ?

Short Answer

Expert verified
The expected number of bets the gambler will make before stopping is: \[E[T] = \frac{(N-2ip)i}{2p - 1}\]

Step by step solution

01

Define the Random Variables and Find Possible Values

Let \(X_j\) denote the gambler's winnings on bet \(j\) with \(j \geq 1\). Since the gambler either wins or loses on each bet, the possible values for \(X_j\) are \(1\) with probability \(p\), or \(-1\) with probability \(1-p\). The sum of winnings after T bets: \[\sum_{j=1}^{T} X_j\] Since the gambler quits when his fortune reaches either \(N\) or \(0\), the possible values of this sum are: \[N-i \text{ (if he wins)}\] or \[-i \text{ (if he loses)}\]
02

Determine \(E\left[\sum_{j=1}^{T} X_{j}\right]\)

To find the expectation of the sum of winnings, we must account for both cases: when the gambler wins and when he loses. Let \(q = 1-p\). Since the known probability of the gambler's final winnings is \(N-i\), we have: \[E\left[\sum_{j=1}^{T} X_{j}\right] = (N-i)p + (-i)q\]
03

Apply Wald's Equation

Wald's equation states that: \[E[T] = \frac{E\left[\sum_{j=1}^{T} X_{j}\right]}{E[X_1]}\] where \(E[X_1]\) is the expected value of a single bet. We have: \[E[X_1] = 1 \cdot p + (-1) \cdot q = p - q\] Now, we can plug \(E\left[\sum_{j=1}^{T} X_{j}\right]\) and \(E[X_1]\) into the equation: \[E[T] = \frac{(N-i)p + (-i)q}{p - q}\]
04

Simplify the Result

Simplify the expression for \(E[T]\): \[E[T] = \frac{(N-i)p + (-i)(1-p)}{p - (1-p)}\] \[E[T] = \frac{(N-i)p - ip + i}{2p - 1}\] \[E[T] = \frac{(N-2ip)i}{2p - 1}\] Thus, the expected number of bets the gambler will make before stopping is: \[E[T] = \frac{(N-2ip)i}{2p - 1}\]

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Consider a renewal process having interarrival distribution \(F\) such that $$ F(x)=\frac{1}{2} e^{-x}+\frac{1}{2} e^{-x / 2}, \quad x>0 $$ That is, interarrivals are equally likely to be exponential with mean 1 or exponential with mean 2 . (a) Without any calculations, guess the equilibrium distribution \(F_{e}\) (b) Verify your guess in part (a).

Let \(\left\\{N_{1}(t), t \geqslant 0\right\\}\) and \(\left[N_{2}(t), t \geqslant 0\right\\}\) be independent renewal processes. Let \(N(t)=\) \(N_{1}(t)+N_{2}(t)\) (a) Are the interarrival times of \(\\{N(t), t \geqslant 0\\}\) independent? (b) Are they identically distributed? (c) Is \(\\{N(t), t \geqslant 0\\}\) a renewal process?

Consider a train station to which customers arrive in accordance with a Poisson process having rate \(\lambda\). A train is summoned whenever there are \(N\) customers waiting in the station, but it takes \(K\) units of time for the train to arrive at the station. When it arrives, it picks up all waiting customers. Assuming that the train station incurs a cost at a rate of \(n c\) per unit time whenever there are \(n\) customers present, find the long-run average cost.

A system consists of two independent machines that each function for an exponential time with rate \(\lambda .\) There is a single repairperson. If the repairperson is idle when a machine fails, then repair immediately begins on that machine; if the repairperson is busy when a machine fails, then that machine must wait until the other machine has been repaired. All repair times are independent with distribution function \(G\) and, once repaired, a machine is as good as new. What proportion of time is the repairperson idle?

An airport shuttle bus picks up all passengers waiting at a bus stop and drops them off at the airport terminal; it then returns to the stop and repeats the process. The times between returns to the stop are independent random variables with distribution \(F\), mean \(\mu\), and variance \(\sigma^{2} .\) Passengers arrive at the bus stop in accordance with a Poisson process with rate \(\lambda\). Suppose the bus has just left the stop, and let \(X\) denote the number of passengers it picks up when it returns. (a) Find \(E[X]\). (b) Find \(\operatorname{Var}(X)\). (c) At what rate does the shuttle bus arrive at the terminal without any passengers? Suppose that each passenger that has to wait at the bus stop more than \(c\) time units writes an angry letter to the shuttle bus manager. (d) What proportion of passengers write angry letters? (e) How does your answer in part (d) relate to \(F_{e}(x) ?\)

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free