2016 SYST465 HW 7 Solutions

Game Theory Question A non-profit firm is on a local community online donation platform for a community event it wants to hold (only community members can donate via the website). The event will be held only if the non-profit firm collects $20,000 total from members of the community. Each member values the event at $500. Suppose that there are 100 community members. Community members can only donate by purchasing a lottery ticket from the firm. Each ticket costs $200 and only one ticket can be purchased per member. The proceeds will be collected by the firm. The lottery winner gets a premier meal at a local restaurant that's worth $100. Remember, the firm keeps all the donated money. If the amount of donations is less than $20,000, then the firm returns the donated money to the community members (since there'll be no event held but the lottery winner still gets to eat that fancy meal). If the donations sum up to $20,000, the community event will take place. What are the Nash…

Can you show me the answer of question (c) and (d)? Thank you so much

E1

Fool experts don't solve it I will dislike

Please try to solve in 30 minute

Exercise 4.1 Amy and Bill simultaneously write a bid on a piece of paper. The bid can only be either 2 or 3. A referee then looks at the bids, announces the amount of the lowest bid (without revealing who submitted it) and invites Amy to either pass or double her initial bid. - The outcome is determined by comparing Amy's final bid to Bill's bid: if one is greater than the other then the higher bidder gets the object and pays his/her own bid; if they are equal then Bill gets the object and pays his bid. Represent this situation by means of two alternative extensive frames. Note: (1) when there are simultaneous moves we have a choice as to which player we select as moving first: the important thing is that the second player does not know what the first player did; (2) when representing, by means of information sets, what a player is uncertain about, we typically assume that a player is smart enough to deduce relevant information, even if that information is not explicitly given to…

What is a payoff matrix?

1. A row of minus signs is written on a whiteboard (can be any number). Two players take turns in replacing either a single minus sign by a plus sign or two adjacent minus signs by two plus signs. The player who makes the last move wins. Discuss the possible strategy for the first mover to force a win.

New answer needed in good format

Consider the Normal Form Game characterized in the following figure: P1 \ P2 A1 A2 A3 A4 B1 B2 B3 B4 (-1,1) (0,0) (1,-1) (2,0) (-2,-2) (2,7) (-1,-1) (-1,1) (5,7) (3,5) (0,0) (0,8) (0,3) (-1,-1) (10,2) (0,0) Which is the set of rationalizable actions? O (A2, A4)x(B2, B3) O (A1, A2)x(B1, B2, B4) O (A1, A3)x(B1, B4) O (A1, A3, A4}x{B1, B3)

6. Battle of the Networks 1\2 %share Sitcom Sitcom 48;52 Sport 42;58 Nature 55:45 58;42 Ans: s; = (0; 0.85; 0.14); V, = 55.43 s; = (0.43; 0.57;0); V½ = 44.57 40;60 63;37 60;40 Sport Nature 56:44 52;48 Find Nash Equilibrium.

8) Consider the following game: There are 10 players. Each player is asked to write a number between 0 and 100. The player whose choice is closest to half of the average is the winner. Describe the game and discuss what would you expect to be the average number if the game were played in class with your colleagues. Do you expect them to play the Nash equilibrium strategy? Explain.

First blank (Eileen or Clancy) 2nd, 3rd, 4th blank (Left or right)

(a) Consider a ROCK PAPER SCISSOR game. Two players indicate either Rock, Paper or Scissor simultaneously. The winner is determined by: Rock crushes Scissors, Paper covers Rock, and Scissor cut Paper. In the case of a tie, there is no payoff. In the case of a win, the winner collects 5 dollars. Write the payoff matrix for this game. (b) Find the optimal row and column strategies and the value of the matrix game. 3 2 4 -2 1 -4 5

Suppose that Jason and Chad each are thinking of opening up a diet coke stand on the fourth floor of this building. Suppose that potential customers are evenly spaced on a distance that is normalized to 1. Customers will buy a diet coke from whichever stand requires the least walking. If they are the same distance the customer will flip a coin. This is depicted below. 1/4 1/2 3/4 Suppose that Jason and Chad are simultaneously choosing the location of their stands, what is the Nash Equilibrium location? a. One of them puts a stand at 3/4 and the other puts a stand at 1/4 b. Chad and Jason put their stands right next to each other at 1/2 c. One of them puts a stand at 0 and the other puts a stand at 1 d. There is no Nash Equilibrium

Please answer clearly through 1. i to iv.

7

Exercise 3.12. Three players, Avinash, Brian and John, play the following game. Two cards, one red and the other black, are shuffled well and put face down on the table. Brian picks the top card, looks at it without showing it to the other players GAME THEORY - Giacomo Bonanno 124 (Avinash and John) and puts it back face down. Then Brian whispers either "Black" or "Red" in Avinash's ear, making sure that John doesn't hear. Avinash then tells John either "Black" or "Red". Finally John announces either "Black" or "Red" and this exciting game ends. The payoffs are as follows: if John's final announcement matches the true color of the card Brian looked at, then Brian and Avinash give $2 each to John. In every other case John gives $2 each to Brian and Avinash. (a) Represent this situation as an extensive-form game. (b) Write the corresponding strategic form (or normal form) assuming that the players are selfish, greedy and risk neutral.

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?

Suppose we have a football player taking a penalty kick. The kicker can kick right or left, and the goalie can defend right or left (assume the kicker's right). Write the game using general parameters. Find all the equilibria, pure and mixed. Draw the best response curves.

Please answer question 7-b

Last answer was incorrect.

Briefly discuss the table and the topic.

[Game theory] A typical game theory question related to linear programming :)

(d) Consider a simultaneous-move game between two firms choosing to sell their product at either £6, £7 or £8. The actions and payoffs are given in the matrix below. Firm 2's Prices £6 £7 £8 Firm 1's prices £6 4, 5 3, 5 2, 1 £7 0,4 2, 1 3,0 £8 -1, 1 4, 3 0, 2 What are the Nash equilibria of this game? Game theory is often used by firms competing under an oligopoly as a means of determining their best strategy. Why is game theory a useful tool and which characteristics of an oligopoly make it particularly useful for firms competing in this market structure? One outcome of an oligopoly is that firms may have an incentive to collude. Explain some of the conditions that make collusion more likely to occur and how game theory can explain why collusive agreements often break down.