(b) Consider the following game. 2 L M H L 4,4 2,4 1,5 1 M 4,2 3,3 0,2 H 5,1 2,0 0,0 Suppose the game above is played twice. The players do not discount the future (i.e. the discount factor for each player is 8 = 1). Describe a subgame-perfect equilibrium of this twice- repeated game in which players play (L, L) in period 1. Consider an auction for a single object with N> 1 symmetric, risk-neutral bidders whose private valuations v¡, i € {1,...,N}, are independent draws from a given distribution F on the in- terval [0, 1]. Prove that in a sealed-bid second-price auction (i.e. Vickrey auction), bidding true value is a weakly dominant strat- egy for any bidder.

(b) Consider the following game. 2 L M H L 4,4 2,4 1,5 1 M 4,2 3,3 0,2 H 5,1 2,0 0,0 Suppose the game above is played twice. The players do not discount the future (i.e. the discount factor for each player is 8 = 1). Describe a subgame-perfect equilibrium of this twice- repeated game in which players play (L, L) in period 1. Consider an auction for a single object with N> 1 symmetric, risk-neutral bidders whose private valuations v¡, i € {1,...,N}, are independent draws from a given distribution F on the in- terval [0, 1]. Prove that in a sealed-bid second-price auction (i.e. Vickrey auction), bidding true value is a weakly dominant strat- egy for any bidder.

ENGR.ECONOMIC ANALYSIS

14th Edition

ISBN:9780190931919

Author:NEWNAN

Publisher:NEWNAN

Chapter1: Making Economics Decisions

Section: Chapter Questions

Problem 1QTC

See similar textbooks

Similar questions

A game involves two players: player A and player B. Player A has three strategies a1, a2 and a3 while player B has three strategies b1, b2 and b3. Player B b1 b2 b3 a1 -40,30 70,20 -10,120 Player A a2 40,60 80,80 60,20 a3 -30,40 -50,110 150, -70 Assuming that this is a one-time game, answer the following questions: Is there any dominant strategy for each player? What is the secure strategy of each player. What is the Nash equilibrium of the game?
2. Consider the two-by-two bimatrix game listed below: Left Right (2,-2) (1,-1) Up Down (3,-3) (-1,1) where the player "Row" chooses the action "up" or "down" and the player "Column" chooses the action "left" or "right". Describe a mixed strategy Nash Equilibrium for this game.
!
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?
Question 1 Consider the following game. Player 1 has 3 actions (Top, middle,Bottom) and player 2 has three actions (Left, Middle, Right). Each player chooses their action simultaneously. The game is played only once. The first element of the payoff vector is player 1’s payoff. Note that one of the payoffs to player 2 has been omitted (denoted by x). A) Suppose that the value of x is such that player 2 has a strictly dominant strategy. Find the solution to the game. What solution concept did you use to solve the game? B) Suppose that the value of x is such the player 2 does NOT have a strictly dominant strategy. Find the solution to the game. What solution concept did you use to solve the game?
Consider the following extensive form game between player 1 and player 2. T B (2, 2) L R R (3, 1) (0, 0) (5, 0) (0, 1) (a). Find the normal form representation of this game. (show the bimatrix) (b). Find all pure strategy NE. (c). Which of these equilibria are subgame perfect?
Show that there does not exist a pure-strategy perfect Bayesian equilibrium in the following extensive-form game. What is the mixed- strategy perfect Bayesian equilibrium? R Player 1 M L Player 2 3
For various values of X(for player1 and player 2), find all Nash equilibria of the following game with von Neumann-Morgenstern preferences:
in game theory, when are there player 1 and palyer 2 and the payoff function is as follow (if player 1 get to choose first) (u1, u2). my question is if the order change like player 2 get to choose first, will the order of the payoff change as well like (u2, u1)?
For the friend-foe game, recall that there were 3 Nash equilibria possible, but the equilibria set didn't include the cooperative outcome, for which both players would win. Friend Foe Friend 500,500 0,1000 Foe 1000,0 0.0 a) If the game is played répeatedly. propose a play strategy that will enforce cooperation. For what valucs of o (discount factor) the equilibrium will be (Friend. Friend)?
- Individuals 1 and 2 are forming a company. The value of their relationship depends on the effort that each expends. Suppose that individual i's utility from the relationship is x² + x; − xixj, where x¿ is individual i 's effort and x ; is the effort of the other person (i = 1, 2). Assume x1, x2 ≥ 0. Which statement is true? There is a Nash equilibrium in which each player chooses effort level k > 0. This equilibrium is Pareto efficient. There is no mixed-strategy Nash equilibrium. There is a unique Nash equilibrium in which each player chooses no effort x¿ = x; = 0. The set of Nash equilibria in this game is finite. There is a Nash equilibrium in which xi = 0 and x ; = 1| =
If the players play pure strategies, the game has no Nash equilibrium. But what if they choose their moves randomly? Let each player instead opt for a mixed strategy instead of a pure strategy. The first will play action Z with probability p, and the second will play action L with probability q. At which pair (p, q) are the mixed strategies of the players in equilibrium? At which pair (p, q) does neither player want to change strategy? When are both strategies simultaneously the best response?