In: Other
In 1713, Nicolas Bernoulli stated a puzzle, now called the St. Petersburg paradox, which works as follows. You have the opportunity to play a game in which a fair coin is tossed repeatedly until it comes up heads. If the first heads appears on the nth toss, you win 2n dollars.
a. Show that the expected monetary value of this game is infinite.
b. How much would you, personally, pay to play the game?
c. Nicolas’s cousin Daniel Bernoulli resolved the apparent paradox in 1738 by suggesting that the utility of money is measured on a logarithmic scale (i.e., U(Sn) = a log2 n + b, where Sn is the state of having $n). What is the expected utility of the game under this assumption?
d. What is the maximum amount that it would be rational to pay to play the game, assuming that one’s initial wealth is $k ?
a.
The probability that the first heads appears on the nth toss is 2−n, so
b.
Typical answers range between $4 and $100.
c.
Assume initial wealth (after paying c to play the game) of $(k − c); then
Assume k − c = $0 for simplicity. Then
d.
The maximum amount c is given by the solution of
For our simple case, we have
a log2 c + b = 2a + b
or c = $4.