Question: Consider the following gamblers ruin problem. A gambler bets $1 on each play of a game. Each time, he has a probability p of winning

Consider the following gambler’s ruin problem. A gambler bets $1 on each play of a game. Each time, he has a probability p of winning and probability q 1  p of losing the dollar bet. He will continue to play until he goes broke or nets a fortune of T dollars. Let Xn denote the number of dollars possessed by the gambler after the nth play of the game. Then

{Xn} is a Markov chain. The gambler starts with X0 dollars, where X0 is a positive integer less than T.

(a) Construct the (one-step) transition matrix of the Markov chain.

(b) Find the classes of the Markov chain.

(c) Let T 3 and p 0.3. Using the notation of Sec. 16.7, find f10, f1T, f20, f2T.

(d) Let T 3 and p 0.7. Find f10, f1T, f20, f2T.

Step by Step Solution

3.40 Rating (163 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction To Operations Research Questions!