Question

1. When playing Rock-Paper-Scissors, each player has the strategies Rock, Paper, and Scissors (abbreviated as R,...

1. When playing Rock-Paper-Scissors, each player has the strategies Rock, Paper, and Scissors (abbreviated as R, P, and S).

What strategy did each player choose in the strategy profile (P, S), and who won?

2. When playing Rock-Paper-Scissors, each player has the strategies Rock, Paper, and Scissors (abbreviated as R, P, and S).

How would Player 2's preferences rank the strategy profiles (P, R) and (S, S)?

Group of answer choices

They would be indifferent between (P, R) and (S, S).

They would prefer (P, R) more than (S, S).

They would prefer (P, R) less than (S, S)

3. Consider the following situation:

Two animals are competing for territory. Each animal chooses to be either Aggressive or Passive in this competition, and has the following preferences over the outcomes:

  • Each animal would prefer to be Aggressive if the other is Passive: this way they win the competition and gain territory.
  • Each animal would prefer to be Passive if the other is Aggressive: this way they lose territory, but they avoid a fight which would leave them injured.
  • Regardless of whether an animal is Passive or Aggressive, they would prefer that their rival is Passive: dealing with an Aggressive rival costs energy and time that they could use for finding food.

When modeled using game theory, which of the following would be strategies in this game?

Group of answer choices

a. Avoid fights

b. Be passive

c. Be aggressive

d. Avoid wasting energy

4. When training for the upcoming season, a sports team can choose to train for overwhelming Offense, overwhelming Defense, or a Balance of the two. When they play a game against another team, their choices of training determine who is most likely to win. The payoffs from this "game of training choice" are given below:

Beavers
Offense Balance Defense
Ducks Offense 0, 0 2, -2 1, -1
Balance -2, 2 0, 0 2, -2
Defense -1, 1 -2, 2 0, 0

In the space below, answer the following questions:

  • Does this game contain any strictly dominated strategies? (You do not need to list them right now.)
  • If so, perform IESDS until none are left. List the order in which you eliminated strategies.
  • Does elimination alone reveal the Nash equilibrium of this game? If so, what is it?

Homework Answers

Answer #1

1) In profile (P,S), S is a strictly dominant strategy. So, each player will choose strategy profile (P,P) and nobody will win.

2) For player 2, (P, R) means Player 1 chooses Paper and 2 chooses rock, in which he loses. Whereas in (S,S), nobody wins anything. So, player 2 will prefer (S,S) over (P,R)

3) 2 strategies will be: Be passive and Be aggressive

4) This game does not have any straictly dominated strategies. For each player, Offense always dominates Balance, except when the other player chooses Defence. Similarly, Balance always dominates Defence, except when other player chooses Offence. The nash equilibrium for this game is (Offence, Offence).

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Code the Rock Paper Scissors program: a. Get a move choice from player A which must...
Code the Rock Paper Scissors program: a. Get a move choice from player A which must be R, P, S or r, p, s Exit with System.exit(0) and an error msg if the user fails to respond correctly b. Get a move choice from player B in the same manner Again, Exit with System.exit(0) and an error msg if the user fails to respond correctly c. Display the results using the accepted phrases from the game Rock breaks Scissors, Paper...
Consider a modified sequential version of Paper Scissors Rock where Player 1 goes first and chooses...
Consider a modified sequential version of Paper Scissors Rock where Player 1 goes first and chooses Paper, Scissors or Rock, and Player 2 goes second and chooses Paper, Scissors, or Rock. For each player, a win gets a payoff of 1, a loss gets a payoff of -1, and a tie get a payoff of 0. (a) (9 points) Write out the entire game tree for this sequential game. (b) (4 points) Find all the subgame perfect equilibria using backwards...
You are playing rock, paper, scissors (RPS) with a friend. Because you are good at predicting...
You are playing rock, paper, scissors (RPS) with a friend. Because you are good at predicting your friend’s strategy, there is a 60% chance each time that you play her, that you win. You play 7 games of rock, paper scissors with your friend and would like to know how many of them you win. Use this information to answer the following questions. 1.What is the probability that you win exactly three of the seven games played? (To four decimal...
Cory and Dana each have three pieces of paper with the letter S (for scissors), P...
Cory and Dana each have three pieces of paper with the letter S (for scissors), P (for paper), or R (for rock) on each piece. They each place one piece of paper on a table at the same time. If both chose the same letter, it is a draw and each gets zero points--nobody wins, nobody loses. If one chose S and the other P, then the first person wins and scores 1 point, while the second loses and scores...
Below is a game between player A and player B. Each player has two possible strategies:...
Below is a game between player A and player B. Each player has two possible strategies: 1 or 2. The payoffs for each combination of strategies between A and B are in the bracket. For example, if A plays 1 and B plays 1, the payoff for A is 1 and the payoff for B is 0. Player B Strategy 1 Strategy 2 Player A Strategy 1 (1,0) (0,1) Strategy 2 (0,1) (1,0) How many pure strategy Nash equilibria does...
Below is a game between player A and player B. Each player has two possible strategies:...
Below is a game between player A and player B. Each player has two possible strategies: 1 or 2. The payoffs for each combination of strategies between A and B are in the bracket. For example, if A plays 1 and B plays 1, the payoff for A is 1 and the payoff for B is 0. Player B Strategy 1 Strategy 2 Player A Strategy 1 (1,0) (0,1) Strategy 2 (0,1) (1,0) How many pure strategy Nash equilibria does...
When playing card games like poker, the strategies available to players can sometimes be summarized as:...
When playing card games like poker, the strategies available to players can sometimes be summarized as: Use Randomness (play unpredictably so that your opponents can't understand your moves). Use Math (calculate probabilities based on the cards you can see, and use this information to make your decisions). Use Psychology (watch your opponents for signs that they have especially good or bad hands). A particular pair of players have different levels of skill in each of these strategies, so that their...
A game has two players. Each player has two possible strategies. One strategy is Cooperate, the...
A game has two players. Each player has two possible strategies. One strategy is Cooperate, the other is Defect. Each player writes on a piece of paper either a C for cooperate or a D for defect. If both players write C, they each get a payoff of $100. If both players write D, they each get a payoff of 0. If one player writes C and the other player writes D, the cooperating player gets a payoff of S...
R-S-P Requirement: - write one C++ program that mimics the Rock-Scissor-Paper game. This program will ask...
R-S-P Requirement: - write one C++ program that mimics the Rock-Scissor-Paper game. This program will ask user to enter an input (out of R-S-P), and the computer will randomly pick one and print out the result (user wins / computer wins). - User's input along with computer's random pick will be encoded in the following format: -- user's rock: 10 -- user's scissor:          20 -- user's paper:            30 -- comp's rock:            1 -- comp's scissor:        2 -- comp's...
1. REPRESENT BOTH ANSWERS IN NORMAL FORM A. Represent the following strategic situation in a NORMAL...
1. REPRESENT BOTH ANSWERS IN NORMAL FORM A. Represent the following strategic situation in a NORMAL FORM game. Janet is a contestant on a popular game show, and her task is to guess behind which door Liz, another contestant, is standing. With Janet out of the room, Liz chooses a door behind which to stand—either door A or door B. The host, Monty, observes this choice. Janet, not having observed Liz’s choice, then enters the room. Monty says to Janet...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT