Consider a two-player game in which the players take turns, with player 1 moving first. When it is a player's turn, she must announce a number between 1 and 3. The announced number is added to the previously announced numbers. The player who announces the number such that the sum of all announced numbers is 6 wins (receives 1) and the other loses (receives 0). Please indicate whether or not each of the following sequences of announcements is a Nash equilibrium of the game. Hint: Think about how one verifies whether or not a pair of strategies is a Nash equilibrium. P1 says 3, then P2 says 2, then P1 says 1 P1 says 1, then P2 says 3, then P1 says 2 P1 says 2, then P2 says 3, then P1 says 1 P1 says 3, then P2 says 1, then P1 says 2

Consider a two-player game in which the players take turns, with player 1 moving first. When it is a player's turn, she must announce a number between 1 and 3. The announced number is added to the previously announced numbers. The player who announces the number such that the sum of all announced numbers is 6 wins (receives 1) and the other loses (receives 0). Please indicate whether or not each of the following sequences of announcements is a Nash equilibrium of the game. Hint: Think about how one verifies whether or not a pair of strategies is a Nash equilibrium. P1 says 3, then P2 says 2, then P1 says 1 P1 says 1, then P2 says 3, then P1 says 2 P1 says 2, then P2 says 3, then P1 says 1 P1 says 3, then P2 says 1, then P1 says 2

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.7P

See similar textbooks

Similar questions

In the following symmetric general sum game (2, 2) (0,0) (0,0) (0,0) (0,0) (2, 2) (0,0) (2,2) (0,0) (i) Find all pure Nash equilibria. (ii) Find all mixed Nash equilibria in which all probabilities are positive. (vi) Which of these are evolutionary stable strategies?
With what probability does player 1 play Down in the mixed strategy Nash equilibrium? (Input your answer as a decimal to the nearest hundredth, for example: 0.14, 0.56, or 0.87). PLAYER 1 Up Down PLAYER 2 Left 97,95 47, 33 Right 8,43 68,91
Two network TV channels compete in the same market. They can broadcast a sitcom or a game show in prime time. Their objective is to maximize viewership in their local market. The outcomes corresponding to each of their strategies is shown below. Use your mouse to point and click on the Nash equilibrium outcome(s). [There may be more than one so make sure you work out all the best response strategies]. Network 1 Sitcom O Game show O Sitcom Network 2 55%,45% 50%,50% Game show 52%,48% O 45%,55% O
Game Theory Consider the entry game with incomplete information studied in class. An incumbent politician's cost of campaigning can be high or low and the entrant does not know this cost (but the incumbent does). In class, we found two pure-strategy Bayesian Nash Equilibria in this game. Assume that the probability that the cost of campaigning is high is a parameter p, 0 < p < 1. Show that when p is large enough, there is only one pure-strategy Bayesian Nash Equilibrium. What is it? What is the intuition? How large does p have to be? Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.
Problem 2. Consider the partnership-game we discussed in Lecture 3 (pages 81-87 of the textbook). Now change the setup of the game so that player 1 chooses x = [0, 4], and after observing the choice of x, player 2 chooses y ≤ [0, 4]. The payoffs are the same as before. (a) Find all SPNE (subgame perfect Nash equilibria) in pure strategies. (b) Can you find a Nash equilibrium, with player 1 choosing x = 1, that is not subgame perfect? Explain.
4. You have probably had the experience of trying to avoid encountering someone, whom we will call Rocky. In this instance, Rocky is trying to find you. It is Saturday night and you are choosing which of two possible parties to attend. You like Party 1 better and, if Rocky goes to the other party, you get a payoff 20 at Party 1. If Rocky attends Party 1, however, you are going to be uncomfortable and get a payoff of 5. Similarly, Party 2 gives you a payoff of 15, unless Rocky attends, in which case the payoff is 0. Rocky likes Party 2 better, but he is likes you. He values Party 2 at 10, Party 1 at 5, and your presence at either party that he attends is worth an additional payoff of 10. You and Rocky both know each others strategy space (which party to attend) and payoffs functions.
Players 1, 2, and 3 are playing a game in which the strategy of player i isdenoted yi and can be any nonnegative real number. The payoff function for player 1 is V1(y1,y2,y3) = y1 + y1y2 - (y1)2,for player 2 is V2(y1,y2,y3) = y2 + y1y2 - (y2)2,and for player 3 is V3(y1,y2,y3) = (10 - y1 - y2 - y3)y3.These payoff functions are hill shaped. Find a Nash equilibrium. (Hint: Thepayoff functions are symmetric for players 1 and 2.)
Suppose there are two players playing a game with east or west and south and nerth ways. Find the expected Nash equilibrium by using the concept of probabilities. Player X Left[L) Right|R) Player Y Up(U) (5,6) (0,8) (4,6) Down[D) (0,9)
In Homework 1, we saw that there is no strict dominant strategy equilibrium in an inspection game. Thus, the players must randomize and play a mixed strategy in equilibrium. Suppose the agent shirks with probability p₁ and works with probability (1 - p₁), while the principal inspects with probability p2 and does not inspect with probability (1-P2). Find the mixed strategy equilibrium for this game. I NI S (0, -k) (w, -w) W (w c, p-w-k)| (wc, p-w) Table 1: Payoff matrix for the inspection game
Consider a Vickery auction. There are N bidders, each of them values the object £vi, with i = 1…N. Each bidder can submit a bid in a sealed envelope. Once all the bids have been made, the envelopes are opened. The winner of the auction is the bidder who made the highest bid, however, s/he pays the second-highest bid. What are the weakly dominant strategies in this game? Is there only one?
Consider the following simultaneous game: Player 1 U D Player 2 L 30,20 -10, -10 R -10, -10 20,30 Suppose player 1 plays a mixed strategy in which she plays U 25% of the time and D 75% of the time, and player 2 plays a mixed strategy in which she plays L 25% of the time and R 75% of the time. This pair of strategies ✓a Nash equilibrium. Player 1's expected payoff from playing U (when player 2 plays the mixed strategy above) is
Finding Nash Equilibria Consider the following two player, normal form game: Player 1 Player 2 C L (2,1) U M (-2,-2) D R (2, -1) (1,2) (-1, 1) (0,0) (3,1) (0,0) (-1,-1) Find all pure and mixed strategy Nash equilibria. Calculate each player's expected payoffs at each equilibrium.