/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Problem 30 A person tosses a fair coin unti... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

A person tosses a fair coin until a tail appears for the first time. If the tail appears on the \(n\) th flip, the person wins \(2^{n}\) dollars. Let \(X\) denote the player's winnings. Show that \(E[X]=+\infty .\) This problem is known as the St. Petersburg paradox. (a) Would you be willing to pay \(\$ 1\) million to play this game once? (b) Would you be willing to pay \(\$ 1\) million for each game if you could play for as long as you liked and only had to settle up when you stopped playing?

Short Answer

Expert verified
The expected value of the player's winnings in the St. Petersburg paradox is \(\infty\). However, despite the infinite expected value, many people would not be willing to pay $1 million to play the game once or repeatedly, as the most probable outcomes provide much lower winnings compared to the cost, and the small probability of extremely large winnings does not compensate that risk. If allowed to play for as long as desired, some players may be more willing to pay the cost, although the potential for significant loss remains a deterrent.

Step by step solution

01

Compute the probability of each outcome

Let's first find out the probability of the tail appearing on the \(n\)th flip. Since the coin is fair, the probability of getting tails on any single flip is \(0.5\), and the probability of getting \(n-1\) heads in a row before the first tail appears is \((0.5)^{n-1}\). For example, if \(n=3\), the probability of the outcome is \(0.5^2 = 0.25\) because there are two coin flips with heads.
02

Calculate the winnings corresponding to each outcome

For each outcome, we are given that the person wins \(2^n\) dollars. Given a certain number of flips, \(n\), we can calculate the winnings as \(2^n\) dollars.
03

Compute the expected value of the winnings

The expected value of the player's winnings is the sum of the expected winnings for each outcome. For each outcome, we multiply the probability of the outcome with the corresponding winnings. Mathematically, we can write this as: \[E[X] = \sum_{n=1}^{\infty} P(\text{tail on }n\text{th flip}) \times (\text{winnings on }n\text{th flip})\] \[E[X] = \sum_{n=1}^{\infty} (0.5)^{n-1} \times (2^n)\] Next, let's simplify the expression above: \[E[X] = \sum_{n=1}^{\infty} (\frac{1}{2})^{n-1} \times 2^n\] \[E[X] = \sum_{n=1}^{\infty} 2\] Since the summation diverges, the expected value of the player's winnings is \(\infty\). This means that, theoretically, over an infinite amount of games, the player should have infinite winnings, which is referred to as the St. Petersburg paradox.
04

Answer questions (a) and (b)

(a) Considering that the expected value of the winnings is infinite, it might seem that paying \(1\) million dollars to play the game once is a good idea. However, people usually refuse this offer because the potential loss of \(1\) million dollars is significant. Moreover, the most probable outcomes of the game provide much lower winnings compared to the cost, and the small probability of extremely large winnings does not compensate that risk. (b) If a player had the option to play the game for as long as they liked and only settle up when they stopped playing, they might be more willing to pay \(1\) million for each game. In this scenario, the chances of having a large winning increase as the number of games also increases, and it might help players to offset the costs. However, people still may not be willing to take the risk, as the potential loss could be significant if they need to stop playing earlier than they planned.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Suppose that a die is rolled twice. What are the possible values that the following random variables can take on: (a) the maximum value to appear in the two rolls; (b) the minimum value to appear in the two rolls; (c) the sum of the two rolls; (d) the value of the first roll minus the value of the second roll?

\(A\) and \(B\) play the following game: \(A\) writes down either number 1 or number \(2,\) and \(B\) must guess which one. If the number that \(A\) has written down is \(i\) and \(B\) has guessed correctly, \(B\) receives \(i\) units from \(A .\) If \(B\) makes a wrong guess, \(B\) pays \(\frac{3}{4}\) unit to A. If \(B\) randomizes his decision by guessing 1 with probability \(p\) and 2 with probability \(1-p,\) determine his expected gain if (a) \(A\) has written down number 1 and (b) \(A\) has written down number 2 What value of \(p\) maximizes the minimum possible value of \(B^{\prime}\) s expected gain, and what is this maximin value? (Note that \(B\) 's expected gain depends not only on \(p,\) but also on what \(A\) does. Consider now player \(A .\) Suppose that she also randomizes her decision, writing down number 1 with probability \(q\). What is \(A\) 's expected loss if (c) \(B\) chooses number 1 and \((\text { d) } B \text { chooses number } 2 ?\) What value of \(q\) minimizes \(A\) 's maximum expected loss? Show that the minimum of \(A\) 's maximum expected loss is equal to the maximum of \(B\) 's minimum expected gain. This result, known as the minimax theorem, was first established in generality by the mathematician John von Neumann and is the fundamental result in the mathematical discipline known as the theory of games. The common value is called the value of the game to player \(B\).

A fair coin is continually flipped until heads appears for the 10 th time. Let \(X\) denote the number of tails that occur. Compute the probability mass function of \(X\)

A game popular in Nevada gambling casinos is Keno, which is played as follows: Twenty numbers are selected at random by the casino from the set of numbers 1 through \(80 .\) A player can select from 1 to 15 numbers; a win occurs if some fraction of the player's chosen subset matches any of the 20 numbers drawn by the house. The payoff is a function of the number of elements in the player's selection and the number of matches. For instance, if the player selects only 1 number, then he or she wins if this number is among the set of \(20,\) and the payoff is \(\$ 2.2\) won for every dollar bet. (As the player's probability of winning in this case is \(\frac{1}{4},\) it is clear that the "fair" payoff should be \(\$ 3\) won for every \(\$ 1\) bet.) When the player selects 2 numbers, a payoff (of odds) of \(\$ 12\) won for every \(\$ 1\) bet is made when both numbers are among the 20 (a) What would be the fair payoff in this case? Let \(P_{n, k}\) denote the probability that exactly \(k\) of the \(n\) numbers chosen by the player are among the 20 selected by the house. (b) Compute \(P_{n, k}\) (c) The most typical wager at Keno consists of selecting 10 numbers. For such a bet the casino pays off as shown in the following table. Compute the expected payoff: $$\begin{array}{cc} \hline \multicolumn{2}{c} {\text { Keno Payoffs in 10 Number Bets }} \\ \hline \text { Number of matches } & \text { Dollars won for each \$1 bet } \\\ \hline 0-4 & -1 \\ 5 & 1 \\ 6 & 17 \\ 7 & 179 \\ 8 & 1,299 \\ 9 & 2,599 \\ 10 & 24,999 \\ \hline \end{array}$$

It is known that diskettes produced by a certain company will be defective with probability \(.01,\) independently of each other. The company sells the diskettes in packages of size 10 and offers a money-back guarantee that at most 1 of the 10 diskettes in the package will be defective. The guarantee is that the customer can return the entire package of diskettes if he or she finds more than one defective diskette in it. If someone buys 3 packages, what is the probability that he or she will return exactly 1 of them?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.