In a game of chicken, two drivers are heading towards each other on a collision course. The first one to swerve is considered the "chicken" and loses. What is the Nash equilibrium in this game? a) Both drivers swerve b) Neither driver swerves c) One driver swerves while the other doesn't d) It depends on the specific

Three politicians are voting on whether to allow themselves a salary increase of$3,500per a year. If they vote in favor of a raise, then they lose some public support, costing them each$1,500 per year. The salary increase passes if two or more politicians vote in favor of it. What is this game’s Nash equilibrium (or equilibria)? Explain. There is no need to draw a payoff matrix.

Consider a beauty-contest game in which n players simultaneously pick a number between zero and 100 inclusive; the person whose number is closer to half of the average number wins a prize. What is the unique Nash equilibrium of this game? What number will a level-3 thinker pick?

Cameron and Luke are playing a game called ”Race to 10”. Cameron goes first, and the players take turns choosing either 1 or 2. In each turn, they add the new number to a running total. The player who brings the total to exactly 10 wins the game. a) If both Cameron and Luke play optimally, who will win the game? Does the game have a first-mover advantage or a second-mover advantage? b) Suppose the game is modified to ”Race to 11” (i.e, the player who reaches 11 first wins). Who will win the game if both players play their optimal strategies? What if the game is ”Race to 12”? Does the result change? c) Consider the general version of the game called ”Race to n,” where n is a positive integer greater than 0. What are the conditions on n such that the game has a first mover advantage? What are the conditions on n such that the game has a second mover advantage?

Let's think about a traditional game theory principal agent game. In this game we have two players, Lauren and Jason Lauren will choose to invest $500 dollars with Jason If she doesn't invest the money, she keeps the $500 and Jason gets nothing If she does invest the money, then Jason has a choice-he can cooperate by investing Lauren's money and then splitting the profit of another $500. This would give Lauren $750 (her original $500 investment plus $250 of profit) and would give Jason $250. Jason's other choice is to appropriate, or to steal Lauren's money and not invest it. If he does this, Lauren ends up with nothing and Jason has the entire $500. The following diagram outlines this game. Principal Agent Game Jason (750.250) Invest appropriate 10. 500) doninve What will happen in this game? Lauren will not invest Lauren will invest and Jason will cooperate Lauren will invest and Jason will appropriate Next page

find all Nash equilibria in this game using von  Neumann-Morgenstern preferences:

Hello, please help me to solve this Game Theory question. Thanks in advance! Hobby hunter Jack decides what to do the next weekend. He can either stay at home and watch movies (Movies), or call his friend Katherine to go hunting (Hunt). If he stays in, both Jack and Katherine get a payoff of 2. If he decides to hunt, he knows the situation with his friend will resemble a classic stag hunt game with simultaneous moves: Hunting a stag is better than hunting a rabbit, but it only works if they cooperate. The hunting subgame is captured as:     Katherine       Stag Rabbit Jack Stag 3 , 3 0 , 1   Rabbit 1 , 0 1 , 1 1. Write the normal form representation of the full game, including Jack’s initial decision.2. Identify any pure-strategy Nash equilibria. How does this compare to the pure strategy Nash equilibria of the hunting game alone?

find all Nash equilibria in this game using von  Neumann-Morgenstern preferences:

Player 2 Middle Left P1: $45 P1: $70 Up P2: $45 P2: $50 Player 1 P1: $50 P1: $60 Middle P2: $50 P2: $60 P1: $60 P1: $50 Down P2: $60 P2: $70 In the game shown above, list all of the Nash Equilibrium (please check ALL that apply) (up, left) (up, middle) (up, right) (middle, left) (middle, middle) (middle, right) (down, left) (down, middle) (down, right) No equilibrium Right P1: $45 P2: $60 P1: $50 P2: $70 P1: $60 P2: $60

Describe the game and find all Nash equilibria in the following situation: Each of two players chooses a non-negative number. In the choice (a1, a2), the payoff of the first player is equal to a1(a2 - a1), and the payoff of the second player is equal to a2(1 – a1 – a2).