Two friends are dividing a prize worth $10. Each of two players announces an integer a1...

Two friends are dividing a prize worth $10. Each of two players announces an integer a1 and a2 respectively between 0 and 10 both inclusive. If the sum of the numbers named is less than or equal to 10, they each get the number they named and the remainder is destroyed. If the sum a1 + a2 >10 and both claims are the same, then the prize is equally divided. If a1 + a2 >10 and the two integers named are different then minimum of the two claims gets the claimed amount and the other one gets the remainder if any.

Model as a strategic game

Does either player have any dominating strategy?

Is the game dominance solvable? If so, solve for the IEDS equilibrium to the game. If not, clearly mention the strategies that survive IEDS.

Solutions

Expert Solution

Rahul Sunny answered 2 years ago

Next > < Previous

Related Solutions

There are two players in the game. Each player can pick any integer number between 1...

There are two players in the game. Each player can pick any integer number between 1 and n. If two numbers are the same then player 1 pays 1 dollar to player 2. If two numbers are different than nothing happens. (a) Prove that there are no equilibria in pure strategies; (b) Prove that in the equilibrium each strategy should be played with a positive probability. (c) Find all NE of the game.

Each of two players chooses a positive integer. If player i's integer is greater than player j's integer and less than three times this integer, then player j pays $1 to player i.

Question is based off of Game Theory Mixed strategy and Pure strategy Nash EquilibriumEach of two players chooses a positive integer. If player i's integer is greater than player j's integer and less than three times this integer, then player j pays $1 to player i. If player i's integer is at least three times greater than player j's integer, then player i pays $1 to player j. If the integers are equal, no payment is made. Each player's preferences...

Dividing money: Two people have $10 to divide between themselves. They use the following procedure. Each...

Dividing money: Two people have $10 to divide between themselves. They use the following procedure. Each person names a number of dollars (a nonnegative integer), at most equal to 10. If the sum of the amounts that the people names is at most 10, then each person receives the amount of money she named (and the remainder is destroyed). If the sum of the amounts that the people name exceeds 10 and the amounts named are different, then the person...

(10 marks) Two players (player A and player B) are playing a game against each other...

Two players (player A and player B) are playing a game against each other repeatedly until one is bankrupt. When a player wins a game they take $1 from the other player. All plays of the game are independent and identical. a) Suppose player A starts with $2 and player B starts with $1. If player A wins a game with probability p, what is the probability that player A wins all the money? b) Suppose player A starts with...

There are two players, each holding a box. At the beginning of the game, each box...

There are two players, each holding a box. At the beginning of the game, each box contains one dollar. Player 1 is offered the choice between stopping the game and continuing. If he chooses to stop,then each player receives the money in his own box and the game ends.If Player 1 chooses to continue, then a dollar is removed from his box and two dollars are added to Player 2’s box. Then Player 2 must choose between stopping the game...

T is a tree graph on 10 vertices, each is labled with an integer from 1-10....

T is a tree graph on 10 vertices, each is labled with an integer from 1-10. There are four leaves: 1, 2, 3, and 4. 1. What is the number of possible trees, such that the vertices labeled 1, 2, 3, and 4 are leaves, and the other labeled vertices can be either a leaf or not. 1. What is the number of possible trees, such that only 1, 2, 3, and 4 are leaves.

Two athletes of equal ability are competing for a prize of $10,000. Each is deciding whether...

Two athletes of equal ability are competing for a prize of $10,000. Each is deciding whether to take a dangerous performance-enhancing drug. If one athlete takes the drug and the other does not, the one who takes the drug wins the prize. If both or neither take the drug, they tie and split the prize. Taking the drug imposes health risks that are equivalent to a loss of XX dollars. Complete the following payoff matrix describing the decisions the athletes...

A lottery has a grand prize of $100,000, two runner-up prizes of $12,500 each,

A lottery has a grand prize of $100,000, two runner-up prizes of $12,500 each, four third-place prizes of $2000 each, and six co nsolation prizes of $200 each. If 200,000 tickets are sold for $1 each and the probability of any one ticket winning is the same as that of any other ticket winning, find the expected return on a $1 ticket. (Round your answer to two decimal places.)

Consider a game with two players, each of whom has two types. The types of player...

Consider a game with two players, each of whom has two types. The types of player 1 are T1 = (a,b). The types of player 2 are T2 = (c,d). Suppose the beliefs of the types are p1(c/a) = p2(a/c) = 0.25 and p1(c/b) = p2(a/d) = 0.75. Is there a common prior? If yes, construct one; if no, prove why not.

1. There are two players. Each names an amount at the same time as the other....

1. There are two players. Each names an amount at the same time as the other. They can say $0 or say $10 or anything in between, even fractions of cents. If the amounts total $10 or less they get what they named. If they total more than $10 they get $0. What are the Nash equilbria? To solve this try some pairs of amounts. If they aren’t equilibria – if one player or both could do better by changing...

Subjects