Example 4 for Markov Chain -《赌徒的下场-Gambler‘s Ruin》

Consider two gamblers, A and B, who have a combined fortune of  n dollars. They bet one dollar each on the toss of a coin.

  • If the coin turns up heads, A wins a dollar from B.
  • If the coin turns up tails, B wins a dollar from A.

Suppose the successive coin tosses are independent, and the coin turns up heads with probability p and tails with probability q=1-p.  The game ends when either A or B is broken (or ruined).  Let Xk denote the fortune of gambler A after the k-th toss. 

Plot the state transition diagram.


{Xk, k>=0} is a simple random walk on {0,1,2,…, n} with absorbing barriers at 0 and n.

Calculate the stationary distribution of Xk


阅读更多
个人分类: Markov Chain
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

Example 4 for Markov Chain -《赌徒的下场-Gambler‘s Ruin》

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭