Chapter I
:
A
simple
gambling
game
Chapter gambling A simple I : game Newstead Define - - PowerPoint PPT Presentation
Chapter gambling A simple I : game Newstead Define stochastic process based example Give an gambling with on coin flips Analyze behavior " " long - term example of this Process ) Deth ( stochastic collection
:
A
simple
gambling
game
① Define stochastic
process
② Give
an
example
based
gambling with
coin flips
③ Analyze
"
long
"
behavior
example
( stochastic
Process)
A stochastic
process
is
a
indexed
collection
random variables
{ Xi lien
(we'll
focus
case
where I
,
in
which
case
we'll
view
Xn
as
representing The
state
at
some
system
at time
n
." Discrete
time
evolution stochastic
processes
")
Note :
in general ,
don't expect { Xn3neµ to be
in dcp
.Exe ( counting successful
coin flips )
let
Bn
: lo , is → { Oil)be given
by
Bn ( w)
is
the
nth
binary position
w .
let
Xin
=
B, t
.
Interpretation
i
① sum of fist
n
big positions of w
② total
number of
"heads
" after
n flip,
we'll
tweak
this
by
making
it
into
a simple
gambling
game
.
Exe
( Betting
coin flips)
let
X.
= Sla
.let
X , :{$$aH
if
B ,
if
B , =D
let
Xz
= {
X , tl
if
132=1
* ,
if
132=0
let
Xs
. { YET
,
it
134
if
B>
⇐ 0
In
general
:
Xu
=
at
2113
, t
= at (2B ,
Here
Xa
is
the
amount of
money
after
n
coin flips
Exe
( Belting
an biased
coin flips)
ht
{ Cn)
be
iid
random
vanning
with
BCG : ' )
& Pkn:o)
where
ptg
let
let
X .
,
9 "
C,
let
Xz
= {
X , tl
if
* ,
if 62=0
In
general
:
Xu
=
at
21Gt
= at (24-1)+(24-1) t
Here
Xa
is
The amount of
money
after
n
coin flips
Then
( Coia
flip gambling
density )
IP ( Xu
=
at K)
= ( ing ) pntklz qn
for
and
ntk
is
even .
PI If
in
n
flips
we
have l
successes
,then
we
have
n
failures,
and
so
we
have
a * l
dollars in
my
Hence
Xu
ntk
is
even
,To
have
Xu - atk ,
we
need
ntzk
successes
and
failure,
distributed among
n
coin flips
.How
my ways
can I
place thou
htt
successes
amongst
my
n
coin
tosses ?
we
have to
choose
NII
positions
them The
n
possible positions , and
there
are (Itis) ways to
do this . Each
such
caaligvmtion
with probability
pntkqn
'T
( from
independence of
{ Cn 3) ④
This
is
good , but
it's
not
complete
. Itmisses
① what
is
"
long term
behavior
"
Xu ?
SUN
says
IP (
"I
Xn
p
① this
to
recognize the
"real world
restrictions
"
implicit
in
this
being
a gambling problem
.In particular
, if
Xa
, Then
we
have
to stop
playing
.Defy
( hitting times)
Suppose
as c
. letTo
as o
: * n
To
n 30 : Xn
These
are
the
" first
hitting times
" fer
O
and c.
Big question
:
what
is
RC To
a T . ) ?
How
do
we
approach this ?
Recursion
.The highlight
salient
parameters
, lets
write
so, p (a)
⇐
IP ( To
< To )
.We
get
so
,pla)
< To )
=
IP( C ,
, To < To ) t IP ( CEO , To - To )
=
p
so
,platt) t q sup la
This
gives
a
recurrence
relation that
we
can
solve
for
so , p
la)
.( To be completed in homework)
so , plat
= {Y%
it
p
%
it
f-
'k
Nate : if
p
and it
as
:c ,then
you
have
a
good
chance
to
win
before
going
broke .
if
path
( even by
a little ) ,you
can
be
in
trouble
.Ex
p
a
c
lP( To - To )=
Toooo
100000
2x to
Thy ( Gambler's
Ruin
peek
p
C
Imagine
you
have $a
at
five
O
and
sees
is
probability
p , and th
bank
has Isc
at
time and
success probability
A
T ca To
for
you
,then
To a Tc
for
bank .
(& vice
versa)
This
means
=
So,q( c-a)
bank has c-a
dollars
,
"success g
"and you going
broke
mean,
bank gets all
a
dollars
Bh
what
happens if
you
gamble forever , but
have to
step if
you
ever
go bake ?
E.g. , what
is
IT ( To co) ?
them (you
almost always
lose)
IP ( T. so )
= {
1
if
pe
'k
( Yp)
"
if
p
tf
let
Hc
a- { To - To)
. ThenI HIT l T
Now
use
continuity
and
formula
for failure
version
at
gambler's ruin