# Question: Consider the following gambler s ruin problem A gambler bets 1

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. 29.7, find f10, f1T, f20, f2T.

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

{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. 29.7, find f10, f1T, f20, f2T.

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

## Answer to relevant Questions

Read Selected Reference A11 that describes an OR study done for Philips Electronics. (a) Summarize the background that led to undertaking this study. (b) What was the purpose of this study? (c) What were the benefits of ...Refer to pp. 163–167 of Selected Reference A4 that describes an OR study done for Yellow Freight System, Inc., and the resulting computer system SYSNET. (a) Briefly describe how the OR team gained the support of upper ...Read Selected Reference A8 that describes an OR study done for the Rijkswaterstaat of the Netherlands. (Focus especially on pp. 3–20 and 30–32.) (a) Summarize the background that led to undertaking this study. (b) ...A video cassette recorder manufacturer is so certain of its quality control that it is offering a complete replacement warranty if a recorder fails within 2 years. Based upon compiled data, the company has noted that only 1 ...Suppose that a communications network transmits binary digits, 0 or 1, where each digit is transmitted 10 times in succession. During each transmission, the probability is 0.995 that the digit entered will be transmitted ...Post your question