Question

In: Math

Consider the following game: Three cards are labeled $1, $4, and $7. A player pays a...

Consider the following game: Three cards are labeled $1, $4, and $7. A player pays a $9 entry fee, selects 2 cards at random without replacement, and then receives the sum of the winnings indicated on the 2 cards.

a) Calculate the expected value and standard deviation of the random variable "net winnings" (that is, winnings minus a $9 entry fee)

b) Suppose a 4th card, labelled k, is added to the game but the player still selects two cards without replacement. What is the value of k which makes the game fair (i.e makes expected net winnings = $0)

Solutions

Expert Solution

Please rate. Cheers !!!

a).

P (X1) 1/3
P (X2) 1/2
X1 X2 Y (X1 + X2)
1 4 5
1 7 8
4 1 5
7 1 8
4 7 11
7 4 11

therefore P (Y) = P (X1) * P (X2)

Y Freq. P (Y) W (Y - 9) P (W) W * P (W) W ^2 W ^2 * P (W)
5 2 1/3 -4 1/3 -1 1/3 16 5 1/3
8 2 1/3 -1 1/3 - 1/3 1 1/3
11 2 1/3 2 1/3 2/3 4 1 1/3
sum 1 1 -1 7

b ).

X1' X2' Y' (X1' +X2')
1 4 5
1 7 8
1 K K + 1
4 K K + 4
4 1 5
4 7 11
7 4 11
7 K K + 7
7 1 8
K 1 K + 1
K 7 K + 7
K 4 K + 4
72 + 6K
P (X1') 1/4
P (X2') 1/3
Y' Freq. P (Y') W (Y'- 9)
11 2 1/6 2
5 2 1/6 -4
8 2 1/6 -1
K + 1 2 1/6 K - 8
K + 4 2 1/6 K - 5
K + 7 2 1/6 K - 2
Sum 12 1   

Related Solutions

Your goal is to collect all 80 player cards in a game. The Player cards are...
Your goal is to collect all 80 player cards in a game. The Player cards are numbered 1 through 80. High numbered cards are rarer/more valuable than lower numbered cards. Albert has a lot of money to spend and loves the game. So every day he buys a pack for $100. Inside each pack, there is a random card. The probability of getting the n-th card is c(1.05)-n, For some constant c. Albert buys his first pack on June 1st....
Question 4: Jar Game Consider the following game: Players: 2 - We designate player #1 to...
Question 4: Jar Game Consider the following game: Players: 2 - We designate player #1 to be the one that starts with the jar. Actions: - Each round at the same time both players deposit between 1 to 4 pennies into the jar. - Then both players are able to count the pennies in the jar. - If there are 21 or more pennies, the person with the jar is the winner. - If there are 20 or less pennies,...
Consider the following two-player game, in which Player 1 is the IMF, and Player 2 is...
Consider the following two-player game, in which Player 1 is the IMF, and Player 2 is a debtor country. Reform Waste Aid 3, 2 -2, 3 No Aid -2, 1 0, 0 a) Compute all (pure and mixed) Nash equilibria. b) Do you think that the above game is the case of a resource curse? Interpret the game with a story of a resource curse.
Consider the following game that has two players. Player A has three actions, and player B...
Consider the following game that has two players. Player A has three actions, and player B has three actions. Player A can either play Top, Middle or Bottom, whereas player B can play Left, Middle or Right. The payoffs are shown in the following matrix. Notice that a payoff to player A has been omitted (denoted by x). Player B    Left Middle Right Top (-1,1) (0,3) (1,10) Middle (2,0) (-2,-2) (-1,-1) Bottom (x,-1) (1,2) (3,2) (player A) Both players...
Consider a gambling game where a player pays $10 to play with a 40% chance of...
Consider a gambling game where a player pays $10 to play with a 40% chance of winning $20, 40% chance of winning $1, and a 20% chance of winning $0. (a) If the player’s utility function is U(M) = M, what is the expected utility from playing the game? How does it compare to the player’s utility of not playing the game, i.e. having $10 for sure? Is the player risk-neutral, risk-loving, or risk-averse, and does the player play? (b)...
Consider the following game. Player 1’s payoffs are listed first:                        Player 2 X Y Player...
Consider the following game. Player 1’s payoffs are listed first:                        Player 2 X Y Player 1 A 90 , 1 10 , 0 B 10 , 0 50 , 1 C 100 , 0 80 , 1 Imagine that player 1 makes a decision first and Player 2 makes a decision after observing player 1’s choice. What is the subgame-perfect equilibrium of this game? Imagine that player 2 makes a decision first and Player 1 makes a decision after...
) Consider a game where player 1’s possible three strategies are a, b and c and...
) Consider a game where player 1’s possible three strategies are a, b and c and player 2’s possible strategies are A, B and C. The players choose their strategies simultaneously. The payoff matrix of the game is as follows:                                           Player 2 A B C    a 8,5 9,7 10,8 player 1 b 6,1 10,3 7,9 c 5,4 8,6 6,4 (5 pts) Is there a dominated strategy for player 1? For player 2? Justify your answer. (5 pts) Is...
Consider the game in normal form given in the followingtable. Player 1 is the “row” player...
Consider the game in normal form given in the followingtable. Player 1 is the “row” player with strategiesA,BandCandplayer 2 is the “column” player with strategiesL,CandR. The gameis given in the following table: L C R A 0,0 2,-2 -2,3 B -2,2 0,0 2,-1 C 3,1 -1,2 0,1 (a) Find whether there is a mixed strategy Nash equilibrium (M.S.N.E) where player 1 mixes between A and C and player 2 mixes between L,C and R with positive probability. (b) Find whether...
In a particular card​ game, each player begins with a hand of 3 ​cards, and then...
In a particular card​ game, each player begins with a hand of 3 ​cards, and then draws 6 more. Calculate the probability that the hand will contain one pair​ (2 cards of one​ value, with the other cards of 7 different​ values).
Java: Simple 21 Game (Blackjack) In this game, the dealer deals two "cards" to each player,...
Java: Simple 21 Game (Blackjack) In this game, the dealer deals two "cards" to each player, one hidden, so that only the player who gets it knows what it is, and one face up, so that everyone can see it. There are four players: one human player (user) and three computer players. The players take turns requesting cards, trying to get as close to 21 as possible, but not going over 21. A player may pass. Once a player has...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT