Exercise 1. Two individuals go out on a hunt. Each can individually choose to hunt a...
Two hunters must choose simultaneously between hunting a stag or hunting hares. If a hunter hunts hares, they catch a hare, and get a payoff of 3. If both hunters hunt the stag, they catch it, with a payoff of 5 to each. If a hunter tries to hunt the stag alone while the other hunter hunts hares, they do not succeed, and get a payoff of 0. (a) (2 points) Provide the normal form of this game. (b) (5...
1. Two hunters set out to kill a stag. One has agreed to drive the stag through the forest, and the other to post at a place where the stag must pass. If both faithfully perform their assigned stag-hunting tasks, they will surely kill the stag and each will get an equal share of this large animal. During the course of the hunt, each hunter has an opportunity to abandon the stag hunt and pursue a hare. If a hunter...
3. Consider the following stag hunt game. Two hungry hunters go to the woods with the aim of catching a stag, or at least a hare. They can catch a stag only if both remain alert and devote their time and energy to catching it. Catching a hare is less demanding and does not require the cooperation of the other hunter. Each hunter prefers half a stag to a hare. Letting S denote the action of going after the stag,...
3. Consider the following game. Two players can choose either to hunt a stag, or to hunt a hare. If a player hunts a stag, then they must have the other player’s cooperation in order to succeed. A player can hunt a hare by themself, but a hare is worth less than a stag. The following payoff matrix depicts this situation. What is the Nash equilibrium? Show your work. (10%
Asterix and Obelix go hunting. They can either choose to hunt a boar or hunt a rabbit. Each one chooses their action (to hunt boar or rabbit), without observing the action chosen by the other. If either Asterix or Obelix hunts a boar, they must have the cooperation of their partner in order to succeed. Either Asterix or Obelix can hunt the rabbit by themselves, (i.e., alone, without cooperation from the partner), but a rabbit is worth less than a...
Problem 1. (20 points) Consider a game with two players, Alice and Bob. Alice can choose A or B. The game ends if she chooses A while it continues to Bob if she chooses B. Bob then can choose C or D. If he chooses C the game ends, and if he chooses D the game continues to Alice. Finally, Alice can choose E or F and the game ends after each of these choices. a. Present this game as...
3. (30 pts) Consider the following game. Players can choose either left () or 'right' (r) The table provided below gives the payoffs to player A and B given any set of choices, where player A's payoff is the firat number and player B's payoff is the second number Player B Player A 4,4 1,6 r 6,1 -3.-3 (a) Solve for the pure strategy Nash equilibria. (4 pta) (b) Suppose player A chooses l with probability p and player B...
1. Find the Nash equilibria of the two-player strategic game in which each players set of actions (strategies) is the set of nonnegative numbers and the players payoff functions are ui(a1, a2)- a1 (a2-a1) and u2 (a1, a2) = a2 (1-al-a2).
Declining Industry: Consider two competing firms in a declining industry that cannot support both firms profitably. Each firm has three possible choices, as it must decide whether or not to exit the industry immediately, at the end of this quarter, or at the end of the next quarter. If a firm chooses to exit then its payoff is 0 from that point onward. Each quarter that both firms operate yields each a loss equal to -1, and each quarter that...
Two players are playing a game in which each player requests an amount of money, simultaneously. The amount must be an integer between 11 and 20, inclusive. Each player will receive the amount she requests in $s. A player will receive an additional amount of $20 if she asks an amount that is exactly 1 less than the other player’s amount. All of the above is common knowledge. a) Find the set of all pure-strategy Nash Equilibria. b) Suppose we...