Sign up to mark as complete
Sign up to bookmark this question
Bankrupt
Two players, A and B, play a game in which the winner receives 1 dollar from the other player. Player A has 1 dollar and player B has 2 dollars. Player A is better in this game and wins 2/3 of the games. They play until one of them is bankrupt.
What is the probability that player A wins?
What is the probability that player A wins?
Hint
Take a look at the lesson about Markov Chain Probability (Probability).
Solution
This is a pretty straightforwards Markov chain problem. There are 4 states. The transition graph is given in Figure 1.
The problem starts at state 1. As has been explained in the lessons of this course, we use the following equation:
Proof
If we substitute Equation 4 in Equation 3, we have
The problem starts at state 1. As has been explained in the lessons of this course, we use the following equation:
(1)
(2)
Furthermore, and . Then we have(3)
(4)
Solving these equation gives us and . So, starting with 1 dollar, player A has a 4/7 chance of winning.Proof
If we substitute Equation 4 in Equation 3, we have
(5)
(6)
(7)
(8)
Related Questions
Title | Category | Subcategory | Difficulty | Status |
---|---|---|---|---|
Animal Migations | Probability and Statistics Theory | Markov Chain Probability | Easy | |
Coin Series #1 | Probability and Statistics Theory | Markov Chain Probability | Easy | |
Coin Series #2 | Probability and Statistics Theory | Markov Chain Probability | Medium | |
Coin Series #3 | Probability and Statistics Theory | Markov Chain Probability | Hard | |
Dominant Game | Probability and Statistics Theory | Markov Chain Probability | Medium | |
Jumping Toad | Probability and Statistics Theory | Markov Chain Probability | Medium | |
Random Ant | Probability and Statistics Theory | Markov Chain Probability | Medium | Example |
The Drunkard's Walk | Probability and Statistics Theory | Markov Chain Probability | Hard | |
Top 2000 Songs | Probability and Statistics Theory | Markov Chain Probability | Medium |
Discussion
Please log in to see the discussion.