SlideShare a Scribd company logo
GEK1544 The Mathematics of Games
                          Suggested Solutions to Tutorial 3


1. Consider a Las Vegas roulette wheel with a bet of $5 on black (payoff = 1 : 1) and
a bet of $2 on the specific group of 4 (e.g. 13, 14, 16, 17 ; payoff = 8 : 1). What is the
bettor’s expectation on this combined bet?


Suggested solution.      Let

     A = {outcome is black }        and      B = {outcome     is     13, 14, 16 or 17} .

Then
                                                              2
P1 := P (A and B) = P ({outcome is 13 or 17 }) =                 ,
                                                              38
                                                                                           18 − 2
P2 := P (A and [not B]) = P ({outcome is black but not 13 and 17 }) =                             ,
                                                                                             38
                                                                      2
P3 := P ([not A] and B) = P ({outcome is 14 or 16 }) =                   ,
                                                                      38
P4 := P ([not A] and [not B])
    = P ({ outcome is white, 0 , or 00, and not 14 or 16 } )
      20 − 2    18
    =         =    .
        38      38
These result

         X = P1 · (5 + 2 ∗ 8) + P2 · (5 − 2) + P3 · (2 ∗ 8 − 5) + P4 · (−5 − 2)
              2                  16             2                   18
           =     · (5 + 2 ∗ 8) +    · (5 − 2) +     · (2 ∗ 8 − 5) +    · (−5 − 2)
             38                  38             38                  38
               18        20           4          34
           =       ·5−      ·5 +         ·2∗8−        ·2
               38        38          38          38
                14
           = − .
                38
                                         14   1
That is, the bettor’s expected loss is      ·     ≈ 5.263 cents for every dollar bet.
                                         38 5 + 2

2. A mythical slot machine has three wheels, each containing ten symbols. On each
wheel there is 1 JACKPOT symbol and 9 other non-paying symbols. You put in 1 silver
dollar ($1) in the slot and the payoffs are as follows :
3 JACKPOT symbols – $487 in silver is returned (including your $1).
2 JACKPOT symbols – $10 in silver is returned (including your $1).
1 JACKPOT symbols – $1 in silver is returned (you get your wager back!).
Define what it would mean to say that this slot machine is fair and then show that it is
indeed a fair “one-armed bandit” !
Suggested solution.      Assuming that the slot machine is random.
                                            1 9 9          9 1 9          9 9 1          243
  P1 = P (1 Jackpot symbol exactly) =          ·   ·   +      ·   ·    +     ·   ·    =       ;
                                            10 10 10      10 10 10        10 10 10       1000
                                            1 1 9          1 9 1          9 1 1           27
 P2 = P (2 Jackpot symbols exactly) =          ·   ·   +      ·   ·    +     ·   ·    =       ;
                                            10 10 10      10 10 10        10 10 10       1000
                                            1 1 1           1
          P3 = P (3 Jackpot symbols) =         ·   ·   =        ;
                                            10 10 10      1000
                                            9 9 9         729
pN = P (No Jackpot symbol at all) =            ·   ·   =        = 1 − (P1 + P2 + P3 ) [please verify] .
                                            10 10 10      1000
The profits are 0, 9 and 486, respectively. We infer that
                                                       27 ∗ 9 + 486 − 729
          X = P1 ∗ 0 + P2 ∗ 9 + P3 ∗ 486 + pN ∗ (−1) =                    = 0.
                                                               1000

3. The martingale strategy had the gambler double his bet after every loss, so that
the first win would recover all previous losses plus win a profit equal to the original stake.
Since a gambler with infinite wealth will with probability 1 eventually flip heads, the
Martingale betting strategy was seen as a sure thing by those who practised it.
        Of course, none of these practitioners in fact possessed infinite wealth, and the
exponential growth of the bets would eventually bankrupt those who choose to use the
Martingale. Moreover, it has become impossible to implement in modern casinos, due to
the betting limit at the tables. Because the betting limits reduce the casino’s short term
variance, the Martingale system itself does not pose a threat to the casino, and many will
encourage its use, knowing that they have the house advantage no matter when or how
much is wagered.
        Let one ‘round’ be defined as a sequence of consecutive losses followed by a win,
or consecutive losses resulting in bankruptcy of the gambler.
        After a win, the gambler “resets” and is considered to have started a new round.
A continuous sequence of martingale bets can thus be partitioned into a sequence of
independent rounds. We will analyze the expected value of one round.
        Let be the probability of losing (e.g. betting for “even” for roulette has 20/38
chance of losing). Let y be the amount of the commencing bet, and n the finite number
of bets you can afford to lose. Show that the expected profit (a loss if the number is
negative) per round is given by
                                      y · [1 − (2 )n ] .

Suggested solution.      In the sequence of numbers
                        20 y = 1 ∗ y, 2y, 22 y, · · ·, 2n−1 y, 2n y,
                                                             n
the chance that the better loses the first n games is       . The loss is
                                                                      2n − 1
  1 ∗ y + 2y + 22 y + · · · + 2n−1 y = y 1 + 21 + · · · + 2n−1 = y ·         = y (2n − 1) .
                                                                       2−1
The chance that the better does not lose all n games is (1 − n ). In this case, disregard
where is the win in the ‘round’, the profit is y. Hence
                         n
                   X=        [−(y (2n − 1))] + (1 −   n
                                                          ) y = y · [1 − (2 )n ] .
                                                                1
As a side note, X < 0 once the probability of losing          > 2.

More Related Content

What's hot

Calculus
Calculus Calculus
Math integration-homework help
Math integration-homework helpMath integration-homework help
Math integration-homework help
Expertsmind IT Education Pvt Ltd.
 
Solucionario c.t. álgebra 5°
Solucionario c.t.   álgebra 5°Solucionario c.t.   álgebra 5°
Solucionario c.t. álgebra 5°
Edward Quispe Muñoz
 
Solving Quadratic Equations by Graphing
Solving Quadratic Equations by GraphingSolving Quadratic Equations by Graphing
Solving Quadratic Equations by GraphingDaisyListening
 
Puzzle Solving Using Model Checking
Puzzle Solving Using Model Checking Puzzle Solving Using Model Checking
Puzzle Solving Using Model Checking
Anit Thapaliya
 
When Computers Don't Compute and Other Fun with Numbers
When Computers Don't Compute and Other Fun with NumbersWhen Computers Don't Compute and Other Fun with Numbers
When Computers Don't Compute and Other Fun with Numbers
PDE1D
 
1 4 homework
1 4 homework1 4 homework
1 4 homeworkmath123b
 
Lecture 2.2 graphs ii - solving simult.eqns graphically
Lecture 2.2   graphs ii - solving simult.eqns graphicallyLecture 2.2   graphs ii - solving simult.eqns graphically
Lecture 2.2 graphs ii - solving simult.eqns graphically
Arjuna Senanayake
 
Writing quadratic equation
Writing quadratic equationWriting quadratic equation
Writing quadratic equation
MartinGeraldine
 
5 6 slideand_divide_11_19_12
5 6 slideand_divide_11_19_125 6 slideand_divide_11_19_12
5 6 slideand_divide_11_19_12Samantha Key
 
ES2015 Quiz
ES2015 QuizES2015 Quiz
ES2015 Quiz
Sergey Bolshchikov
 
Factorización aplicando Ruffini o Método de Evaluación
Factorización aplicando Ruffini o Método de EvaluaciónFactorización aplicando Ruffini o Método de Evaluación
Factorización aplicando Ruffini o Método de EvaluaciónWuendy Garcia
 
Hitting a home run factorising
Hitting a home run factorisingHitting a home run factorising
Hitting a home run factorising
Angela Phillips
 

What's hot (19)

Productos notables
Productos notablesProductos notables
Productos notables
 
Calculus
Calculus Calculus
Calculus
 
Math integration-homework help
Math integration-homework helpMath integration-homework help
Math integration-homework help
 
Solucionario c.t. álgebra 5°
Solucionario c.t.   álgebra 5°Solucionario c.t.   álgebra 5°
Solucionario c.t. álgebra 5°
 
Solving Quadratic Equations by Graphing
Solving Quadratic Equations by GraphingSolving Quadratic Equations by Graphing
Solving Quadratic Equations by Graphing
 
saul-trinomial
saul-trinomialsaul-trinomial
saul-trinomial
 
1150 day 4
1150 day 41150 day 4
1150 day 4
 
4-Cm11 09-10
4-Cm11 09-104-Cm11 09-10
4-Cm11 09-10
 
Puzzle Solving Using Model Checking
Puzzle Solving Using Model Checking Puzzle Solving Using Model Checking
Puzzle Solving Using Model Checking
 
Chapter 08
Chapter 08Chapter 08
Chapter 08
 
4-Cm28 10-11
4-Cm28 10-114-Cm28 10-11
4-Cm28 10-11
 
When Computers Don't Compute and Other Fun with Numbers
When Computers Don't Compute and Other Fun with NumbersWhen Computers Don't Compute and Other Fun with Numbers
When Computers Don't Compute and Other Fun with Numbers
 
1 4 homework
1 4 homework1 4 homework
1 4 homework
 
Lecture 2.2 graphs ii - solving simult.eqns graphically
Lecture 2.2   graphs ii - solving simult.eqns graphicallyLecture 2.2   graphs ii - solving simult.eqns graphically
Lecture 2.2 graphs ii - solving simult.eqns graphically
 
Writing quadratic equation
Writing quadratic equationWriting quadratic equation
Writing quadratic equation
 
5 6 slideand_divide_11_19_12
5 6 slideand_divide_11_19_125 6 slideand_divide_11_19_12
5 6 slideand_divide_11_19_12
 
ES2015 Quiz
ES2015 QuizES2015 Quiz
ES2015 Quiz
 
Factorización aplicando Ruffini o Método de Evaluación
Factorización aplicando Ruffini o Método de EvaluaciónFactorización aplicando Ruffini o Método de Evaluación
Factorización aplicando Ruffini o Método de Evaluación
 
Hitting a home run factorising
Hitting a home run factorisingHitting a home run factorising
Hitting a home run factorising
 

Viewers also liked

S 10
S 10S 10
S 10admin
 

Viewers also liked (8)

S 2
S 2S 2
S 2
 
S 6
S 6S 6
S 6
 
S 4
S 4S 4
S 4
 
S 8
S 8S 8
S 8
 
S 10
S 10S 10
S 10
 
S 7
S 7S 7
S 7
 
S 9
S 9S 9
S 9
 
S 5
S 5S 5
S 5
 

Similar to S 3

Nota math-spm
Nota math-spmNota math-spm
Nota math-spm
Ragulan Dev
 
Unit II B - Game Theory
Unit II B - Game TheoryUnit II B - Game Theory
Game theory
Game theoryGame theory
Game theory
sairajch10
 
legendre.pptx
legendre.pptxlegendre.pptx
legendre.pptx
DiwakarChauhan12
 
Trial Sbp 2007 Answer Mm 1 & 2
Trial Sbp 2007 Answer Mm 1 & 2Trial Sbp 2007 Answer Mm 1 & 2
Trial Sbp 2007 Answer Mm 1 & 2norainisaser
 
U1 02 operaciones expresiones algebraicas
U1   02  operaciones expresiones algebraicasU1   02  operaciones expresiones algebraicas
U1 02 operaciones expresiones algebraicas
UNEFA Zulia
 
Upload
UploadUpload
Upload
vokenn
 
ゲーム理論BASIC 演習4 -交渉集合を求める-
ゲーム理論BASIC 演習4 -交渉集合を求める-ゲーム理論BASIC 演習4 -交渉集合を求める-
ゲーム理論BASIC 演習4 -交渉集合を求める-
ssusere0a682
 
Math resources trigonometric_formulas
Math resources trigonometric_formulasMath resources trigonometric_formulas
Math resources trigonometric_formulas
Er Deepak Sharma
 
Math resources trigonometric_formulas class 11th and 12th
Math resources trigonometric_formulas class 11th and 12thMath resources trigonometric_formulas class 11th and 12th
Math resources trigonometric_formulas class 11th and 12th
Deepak Kumar
 
JAWAB UAN IPA 2006/2007 P12
JAWAB UAN IPA 2006/2007 P12JAWAB UAN IPA 2006/2007 P12
JAWAB UAN IPA 2006/2007 P12Aidia Propitious
 
economics
economicseconomics
economics
SanyiTesfa
 
Dalembert
DalembertDalembert
Dalembert
Richard Gill
 
FUNÇÃO EXPONENCIAL E LOGARÍTMICA
FUNÇÃO EXPONENCIAL E LOGARÍTMICAFUNÇÃO EXPONENCIAL E LOGARÍTMICA
FUNÇÃO EXPONENCIAL E LOGARÍTMICA
Celso do Rozário Brasil Gonçalves
 
Kelly Quant (intro)
Kelly Quant (intro)Kelly Quant (intro)
Kelly Quant (intro)
Jake Vestal
 

Similar to S 3 (20)

Nota math-spm
Nota math-spmNota math-spm
Nota math-spm
 
Unit II B - Game Theory
Unit II B - Game TheoryUnit II B - Game Theory
Unit II B - Game Theory
 
Game theory
Game theoryGame theory
Game theory
 
Ch15s
Ch15sCh15s
Ch15s
 
Add maths 2
Add maths 2Add maths 2
Add maths 2
 
Add Maths 2
Add Maths 2Add Maths 2
Add Maths 2
 
legendre.pptx
legendre.pptxlegendre.pptx
legendre.pptx
 
Trial Sbp 2007 Answer Mm 1 & 2
Trial Sbp 2007 Answer Mm 1 & 2Trial Sbp 2007 Answer Mm 1 & 2
Trial Sbp 2007 Answer Mm 1 & 2
 
Mathematica6
Mathematica6Mathematica6
Mathematica6
 
U1 02 operaciones expresiones algebraicas
U1   02  operaciones expresiones algebraicasU1   02  operaciones expresiones algebraicas
U1 02 operaciones expresiones algebraicas
 
Upload
UploadUpload
Upload
 
ゲーム理論BASIC 演習4 -交渉集合を求める-
ゲーム理論BASIC 演習4 -交渉集合を求める-ゲーム理論BASIC 演習4 -交渉集合を求める-
ゲーム理論BASIC 演習4 -交渉集合を求める-
 
Math resources trigonometric_formulas
Math resources trigonometric_formulasMath resources trigonometric_formulas
Math resources trigonometric_formulas
 
Math resources trigonometric_formulas class 11th and 12th
Math resources trigonometric_formulas class 11th and 12thMath resources trigonometric_formulas class 11th and 12th
Math resources trigonometric_formulas class 11th and 12th
 
JAWAB UAN IPA 2006/2007 P12
JAWAB UAN IPA 2006/2007 P12JAWAB UAN IPA 2006/2007 P12
JAWAB UAN IPA 2006/2007 P12
 
economics
economicseconomics
economics
 
Dalembert
DalembertDalembert
Dalembert
 
Game gg
Game ggGame gg
Game gg
 
FUNÇÃO EXPONENCIAL E LOGARÍTMICA
FUNÇÃO EXPONENCIAL E LOGARÍTMICAFUNÇÃO EXPONENCIAL E LOGARÍTMICA
FUNÇÃO EXPONENCIAL E LOGARÍTMICA
 
Kelly Quant (intro)
Kelly Quant (intro)Kelly Quant (intro)
Kelly Quant (intro)
 

S 3

  • 1. GEK1544 The Mathematics of Games Suggested Solutions to Tutorial 3 1. Consider a Las Vegas roulette wheel with a bet of $5 on black (payoff = 1 : 1) and a bet of $2 on the specific group of 4 (e.g. 13, 14, 16, 17 ; payoff = 8 : 1). What is the bettor’s expectation on this combined bet? Suggested solution. Let A = {outcome is black } and B = {outcome is 13, 14, 16 or 17} . Then 2 P1 := P (A and B) = P ({outcome is 13 or 17 }) = , 38 18 − 2 P2 := P (A and [not B]) = P ({outcome is black but not 13 and 17 }) = , 38 2 P3 := P ([not A] and B) = P ({outcome is 14 or 16 }) = , 38 P4 := P ([not A] and [not B]) = P ({ outcome is white, 0 , or 00, and not 14 or 16 } ) 20 − 2 18 = = . 38 38 These result X = P1 · (5 + 2 ∗ 8) + P2 · (5 − 2) + P3 · (2 ∗ 8 − 5) + P4 · (−5 − 2) 2 16 2 18 = · (5 + 2 ∗ 8) + · (5 − 2) + · (2 ∗ 8 − 5) + · (−5 − 2) 38 38 38 38 18 20 4 34 = ·5− ·5 + ·2∗8− ·2 38 38 38 38 14 = − . 38 14 1 That is, the bettor’s expected loss is · ≈ 5.263 cents for every dollar bet. 38 5 + 2 2. A mythical slot machine has three wheels, each containing ten symbols. On each wheel there is 1 JACKPOT symbol and 9 other non-paying symbols. You put in 1 silver dollar ($1) in the slot and the payoffs are as follows : 3 JACKPOT symbols – $487 in silver is returned (including your $1). 2 JACKPOT symbols – $10 in silver is returned (including your $1). 1 JACKPOT symbols – $1 in silver is returned (you get your wager back!). Define what it would mean to say that this slot machine is fair and then show that it is indeed a fair “one-armed bandit” !
  • 2. Suggested solution. Assuming that the slot machine is random. 1 9 9 9 1 9 9 9 1 243 P1 = P (1 Jackpot symbol exactly) = · · + · · + · · = ; 10 10 10 10 10 10 10 10 10 1000 1 1 9 1 9 1 9 1 1 27 P2 = P (2 Jackpot symbols exactly) = · · + · · + · · = ; 10 10 10 10 10 10 10 10 10 1000 1 1 1 1 P3 = P (3 Jackpot symbols) = · · = ; 10 10 10 1000 9 9 9 729 pN = P (No Jackpot symbol at all) = · · = = 1 − (P1 + P2 + P3 ) [please verify] . 10 10 10 1000 The profits are 0, 9 and 486, respectively. We infer that 27 ∗ 9 + 486 − 729 X = P1 ∗ 0 + P2 ∗ 9 + P3 ∗ 486 + pN ∗ (−1) = = 0. 1000 3. The martingale strategy had the gambler double his bet after every loss, so that the first win would recover all previous losses plus win a profit equal to the original stake. Since a gambler with infinite wealth will with probability 1 eventually flip heads, the Martingale betting strategy was seen as a sure thing by those who practised it. Of course, none of these practitioners in fact possessed infinite wealth, and the exponential growth of the bets would eventually bankrupt those who choose to use the Martingale. Moreover, it has become impossible to implement in modern casinos, due to the betting limit at the tables. Because the betting limits reduce the casino’s short term variance, the Martingale system itself does not pose a threat to the casino, and many will encourage its use, knowing that they have the house advantage no matter when or how much is wagered. Let one ‘round’ be defined as a sequence of consecutive losses followed by a win, or consecutive losses resulting in bankruptcy of the gambler. After a win, the gambler “resets” and is considered to have started a new round. A continuous sequence of martingale bets can thus be partitioned into a sequence of independent rounds. We will analyze the expected value of one round. Let be the probability of losing (e.g. betting for “even” for roulette has 20/38 chance of losing). Let y be the amount of the commencing bet, and n the finite number of bets you can afford to lose. Show that the expected profit (a loss if the number is negative) per round is given by y · [1 − (2 )n ] . Suggested solution. In the sequence of numbers 20 y = 1 ∗ y, 2y, 22 y, · · ·, 2n−1 y, 2n y, n the chance that the better loses the first n games is . The loss is 2n − 1 1 ∗ y + 2y + 22 y + · · · + 2n−1 y = y 1 + 21 + · · · + 2n−1 = y · = y (2n − 1) . 2−1 The chance that the better does not lose all n games is (1 − n ). In this case, disregard where is the win in the ‘round’, the profit is y. Hence n X= [−(y (2n − 1))] + (1 − n ) y = y · [1 − (2 )n ] . 1 As a side note, X < 0 once the probability of losing > 2.