players choose different integers, the player with the largest integer gets $100, and the two other players get $0. If two players choose the same integer Q, and the third player chooses a different integer Q', then the player playing Q' gets $0, and the two players who played Q get $50 each. Find 2 Nash equilibriums in this game.

Do not use Ai

Suppose that two players are playing the following game. Player 1 can choose either Top or Bottom, and Player 2 can choose either Left or Right. The payoffs are given in the following table: Player 1 Player 2   Left Right Top 6        1 9        4 Bottom 2        4 5        3 where the number on the left is the payoff to Player 1, and the number on the right is the payoff to Player 2.   D) What is Player 1’s maximin strategy?E) What is Player 2’s maximin strategy?F) If the game were played with Player 1 moving first and Player 2 moving second, using the backward induction method we went over in class, what strategy will each player choose?

4.2. Game theory (Prisoner's dilemma). Often, many sectors in an economy have two main rivals, battling it out in the marketplace. There can be rivalry such as between Apple and Samsung in Phones and Laptops. Suppose Apple plans to cut its price. Samsung will likely follow suit to retain its market share. This may end up with low profits for both companies. A price drop by either company may thus be construed as defecting since it breaks an implicit agreement to keep prices high and maximize profits. Thus, if Apple drops its price but Samsung continues to keep prices high, Apple is defecting, while Samsung is cooperating (by sticking to the spirit of the implicit agreement). In this scenario, Apple may win market share and earn incremental profits by selling more. Assume that the incremental profits that accrue to Apple and Samsung are as follows: If both keep prices high (Cooperate), profits for each company increase by AED200 million (because of normal growth in demand). If one drops…

Alice and Julia want to spend time together but have different preferences for their activities. They can choose between two options: going to a soccer game or watching a football game. Alice prefers football and Julia prefers the football game, but they both prefer being together over being apart. If they both choose to attend a soccer game then Julia receives a payoff of 2 and Alice a payoff of 1. If they both choose to attend a football game, then Julia receive a payoff of 1 and Alice a payoff of 2. If one chooses a football game and the other a soccer game then they both receive a payoff of O. The payout matrix below illustrates these payoffs. Which of the following statements are true: I. There is a dominant strategy II. A nash equilibrium exists where Alice attends a football game and Julia attends a soccer game III. A nash equilibrium exists where both friends attend a soccer game IV. Both attending a football game is a stable outcome. Alice Soccer Football Julia Soccer Football…

In the game shown below, Player 1 can move Up or Down, and Player 2 can move Left or Right. The players must move at the same time without knowledge of the other player’s move. The first payoff is for the row player (Player 1) and the second payoff is for the column player (Player 2). Solve each game using game theoretic logic.   Player 2 Player 1 Left Right Up 7, 7 2, 9 Down 9, 2 1, 3

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?

PLAYER B                                                                LEFT                                     RIGHT                             UP                      5 FOR A, 30 FOR B               10 FOR A, 12 FOR B PLAYER A                           DOWN               -2 FOR A, 10 FOR B             8 FOR A, 15 FOR B In the above game, the players are seeking to maximize the number they recieve.  They choose at the same time.      What is the Nash equillibrium?     Player A will choose UP and player B will choose LEFT   Player A will UP and player B will choose RIGHT   Player A will choose DOWN and player B will choose LEFT   Player A will choose DOWN and player B will choose RIGHT   Player A will choose LEFT and player B will choose UP   Player A will choose LEFT and player B will choose DOWN   Player A will choose RIGHT and player B will choose UP   Player A will choose RIGHT and player B will choose DOWN

Two hunters are on a stag hunt. They split up in the forest and each have two strategies: hunt for a stag (S), or give up the stag hunt and instead hunt for rabbit (R). If they both hunt for a stag, they will succeed and each earn a payoff of 9. If one hunts for stag and the other gives up and hunts for rabbit, the stag hunter receives 0 and the rabbit hunter 8. If both hunt for rabbit then each receives 7. Compute all Nash equilibria for this game, called 'The Stag Hunt', depicted below. Which of these equilibria do you think is most likely to be played? Why? S R S 9,9 8,0 R 0,8 7,7

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