DATA605: Discussion Week #10

Bonnie Cooper

11.2.14

With the situation in Exercise 13 (the homework problem), consider the strategy such that for \(i \lt 4\), Smith bets \(min(i, 4 − i)\), and for \(i \geq 4\), he bets according to the bold strategy, where \(i\) is his current fortune. Find the probability that he gets out of jail using this strategy. How does this probability compare with that obtained for the bold strategy?

Will visualize the system and find the solution using the library markovchain.

Define a transition matrix between states in the system. In other words, how Smith’s money situation changes as he plays.

##    $0  $1  $2  $3  $4  $5  $6  $7 $8
## $0  1 0.4 0.4 0.0 0.4 0.0 0.0 0.0  0
## $1  0 0.0 0.0 0.0 0.0 0.0 0.0 0.0  0
## $2  0 0.6 0.0 0.4 0.0 0.4 0.0 0.0  0
## $3  0 0.0 0.0 0.0 0.0 0.0 0.0 0.0  0
## $4  0 0.0 0.6 0.6 0.0 0.0 0.4 0.0  0
## $5  0 0.0 0.0 0.0 0.0 0.0 0.0 0.0  0
## $6  0 0.0 0.0 0.0 0.0 0.0 0.0 0.4  0
## $7  0 0.0 0.0 0.0 0.0 0.0 0.0 0.0  0
## $8  0 0.0 0.0 0.0 0.6 0.6 0.6 0.6  1

##       $1   $2    $3  $4    $5   $6    $7
## $0 0.784 0.64 0.496 0.4 0.256 0.16 0.064
## $8 0.216 0.36 0.504 0.6 0.744 0.84 0.936

Here is what Smith’s chances looks like playing with this strategy:
\(P( \mbox{Smith get's out of jail} ) =\) 0.216
\(P( \mbox{Smith stays in jail} ) =\) 0.784