赌徒破产问题
Gambler's Ruin Problem
题目详情
玩家 M 有 1 美元,玩家 N 有 2 美元。每局赢家从输家处赢走 1 美元。M 更强,每局获胜概率为 。一直玩到一方破产为止。问:M 最终获胜的概率是多少?
Player M has $1, and player N has $2. Each round, the winner takes $1 from the loser. Player M is better and wins each round with probability . They play until one player is ruined (bankrupt). What is the probability that M wins?
解析
把状态定义为 M 当前拥有的美元数:。
- 状态 0、3 是吸收态。
- 从 1 到 0 的概率 ,从 1 到 2 的概率 。
- 从 2 到 1 的概率 ,从 2 到 3 的概率 。
设 为从状态 出发 M 最终获胜(到达 3)的概率,则
解得 ,因此 M 初始为 1 美元时获胜概率为 。
Original Explanation
- State space can be represented by how many dollars M has: .
- States 0 and 3 are absorbing (once M has 0 or 3 dollars, the game ends).
- The transition probabilities are:
- From 1 to 0 with probability , and from 1 to 2 with probability .
- From 2 to 1 with probability , and from 2 to 3 with probability .
- Solving the absorption probability equations yields
Thus, if M starts with $1, the probability that M wins is .