Consider the following Bayesian game. There are two players 1 and 2. Both players choose whether to play A or B. Two states are possible, L and R. In the former, players play a stag-hunt game, and in the latter, players play a matching pennies game. Suppose that Player 2 knows the state, while Player 1 thinks that the state is L with probability q and R with probability 1 ! q. Payo§s in each state respectively satisfy: Player 1 is the row player, and their payo§ is the first to appear in each entry. Player 2 is the column player and their payo§ is the second to appear in each entry. (a) What is the set of possible strategies for the two players in this game?  (b) Find all the pure strategy Bayes Nash equilibria for any value of q 2 (0, 1).

Here is a Bayesian BOS game. Man has a special preference t1 on boxing while woman has a special preference t2 on opera. Both are in [0,2]. The preference information is private. i.e. Each knows his (her) own preference but does not know the other's preference. The below is the payoff. M/W Boxing Opera Воxing 3+t1,1 0,0 Opera 0,0 1,3+t2 We are checking whether the below strategy profile is a Bayesian Nash Equilibrium. "Man chooses boxing if t1>p while woman chooses opera if t2>g." 1) Given t1, man will choose boxing if t1> /g- 2) Given t2, woman will choose opera if t2> /p- 4) By shoving the simultaneous equations, we get p=q=sqrt(6)-

Exercise 1.8. Consider the following "third-price" auction. There are n≥ 3 bidders. A single object is auctioned and Player / values the object $v,, with V, > 0. The bids are simultaneous and secret. The utility of Player / is: 0 if she does not win and (v-p) if she wins and pays $p. Every non-negative number is an admissible bid. Let b, denote the bid of Player i. The winner is the highest bidder. In case of ties the bidder with the lowest index among those who submitted the highest bid wins (e.g. if the highest bid is $120 and it is submitted by players 6, 12 and 15, then the winner is Player 6). The losers don't get anything and don't pay anything. The winner gets the object and pays the third highest bid, which is defined as follows. Let be the winner and fix a Player j such that b₁ = max({b,,...,b,}\ {b}) [if GAME THEORY - Giacomo Bonanno 39 max({b,...,b}\{b;}) contains more than one element, then we pick one of them]. Then the third price is defined as max({b₁,...,b}\{b,,b;}).…

Player 1 and Player 2 will play one round of the Rock-Paper-Scissors game. The winner receives a payoff +1, the loser receives a payoff -1. If it is a tie, then each player receives a payoff zero. Suppose Player 2 is using a non-optimal strategy: he/she plays Rock with probability 35%; Paper with probability 45%; and Scissors with probability 20%. Given that Player 1 knows Player 2 is using this strategy, the best response of Player 1 is to play O a mixed strategy with probability 1/3 each (Rock, Paper and Scissors) O Scissors with probability 100% O any strategy (any strategy is a best response for Player 1) O Rock with probability 100% O Paper with probability 100%

How would this exercise be solved step by step?

Firms A and B are contemplating whether or not to invest in R&D. Each has two options: “Invest” and “Abstain.” A firm that invests will invent product X with a probability of 0.5, whereas a firm that abstains is incapable of invention. Investment costs $6. If a firm doesn’t invent X, it makes $0 in revenue. If a firm invests and is the only one to invent X, it becomes a monopolist and generates $20 in revenue. If both firms invent X, each firm becomes a duopolist, and generates $8 in revenue. Revenues are gross figures (i.e. they are not net of investment costs), and there are no costs besides investments costs (i.e. no variable cost of production etc.). The firms are risk-neutral entities, and are uninformed of each other’s investment decisions. The “research and development” game is best analyzed as a simultaneous move game, because the parties lack information about each other’s investment decisions. Find the Nash Equilibria (or Equilibrium) of the “research and development”…

None

In the signaling game represented below, there are two types of Player 1, smart and dumb, the probabilities of which are 0.4 and 0.6, respectively. Player 1 is in college and can either ((Q)uit or (G)raduate. Player 2 is a prospective employer and can either (N)ot hire or (H)ire Player 1. Player 2's payoff does not depend upon l's education, only her intelligence. Player 1's payoff depends partly on her education: both types benefit from completing their education, but the smart type gets more out of it. Player l's payoff also depends on 2's hiring decision: the smart type wants a job but the weak type does not. 0,0 1, 1 2, 1 0,0 N H N H 2 Q Q .4 C .6 18 G G N H H 2,0 3,1 3, 1 1,0 (a) Find a separating PBE. (b) Find a pooling PBE. (c) , Find an equilibrium in which one type of player 1 mixes, playing both Q and G with positive probability.