PROBLEM SET 4 L C R T 5,1 0,0 0,0 M 0,0 1,5 0,0 B 0,0 0,0 2,2 A B C D A 1,1 2,2 3,4 9,3 B 2,5 3,3 1,2 7,1 A B C A 1,3 2,-2 0,6 B 3,2 1,4 5,0

Size: px
Start display at page:

Download "PROBLEM SET 4 L C R T 5,1 0,0 0,0 M 0,0 1,5 0,0 B 0,0 0,0 2,2 A B C D A 1,1 2,2 3,4 9,3 B 2,5 3,3 1,2 7,1 A B C A 1,3 2,-2 0,6 B 3,2 1,4 5,0"

Transcription

1 PROBLEM SET 4 1. What is the Opponent s Indifference Property? 2. When the Opponent s Indifference Property holds, why should a player choose his appropriate mixture, given that any other probability distribution yields the same expected payoff? 3. Find ALL (Pure and Mixed Strategy) Nash Equilibria of the following games and the expected payoffs in equilibrium if the game has a mixed strategy Nash Equilibrium: L C R T 5,1 0,0 0,0 M 0,0 1,5 0,0 B 0,0 0,0 2,2 A B C D A 1,1 2,2 3,4 9,3 B 2,5 3,3 1,2 7,1 A B C A 1,3 2,-2 0,6 B 3,2 1,4 5,0 L C R T 0,3 2,0 1,7 M 2,4 0,6 2,0 B 1,3 2,4 0,3 L C R T 2,0 1,1 4,2 M 3,4 1,2 2,3 B 1,3 0,2 3,0 A B A 3,5 3,4 B 5,1 1,2 C 2,2 10,3 A B A 0,5 5,0 B 4,1 1,4 C 3,2 2,3

2 A B C D A 2,1 3,3 2,2 2,0 B 0,3 1,3 3,1 2,2 C 0,0 3,3 1,1 2,2 D 2,1 0,3 1,2 3,0 A B C A 1,1 0,0 2,2 B 3,3 0,3 1,1 C 2,0 3,0 1,4 A B C D A 0,1 1,0 1,0 0,1 B 1,0 0,1 1,0 0,1 C 1,0 1,0 0,1 0,1 D 0,1 0,1 0,1 1,0 4. (Generalizing Pure Coordination Games) Consider the following Pure Coordination Game: Where X>0. A B A X,X 0,0 B 0,0 X,X a) What are the Pure Strategy NE of this game? b) What is the Mixed-Strategy Nash Equilibrium (MSNE)? c) What happens to the MSNE if X changes? What is the intuition behind this result? 5. (Generalizing the Stag-Hunt Game) Consider the following Stag-Hunt Game: A B A X,X 0,Y B Y,0 Y,Y Where X>0, Y>0, and X>Y. a) What are the Pure Strategy NE of this game? b) What is the Mixed-Strategy Nash Equilibrium (MSNE)? c) What happens to the MSNE if X increases? What is the intuition behind this result? d) Derive an expression for the frequency of mismatch between these two players in equilibrium. e) How do you minimize coordination in equilibrium? 6. (Generalizing the Battle-of-the-Sexes Game) Consider the following BOS Game:

3 A B A X,Y 0,0 B 0,0 Y,X Where X>0, Y>0, and X>Y. a) What are the Pure Strategy NE of this game? b) What is the Mixed-Strategy Nash Equilibrium (MSNE)? c) How does the MSNE depend on Y and X? What is the intuition behind this result? d) Derive an expression for the frequency of mismatch between these two players in a MSNE. e) What is the condition for maximum coordination? f) Derive an expression for the expected payoff of each player in equilibrium. g) What is the relationship between X and Y and the expected payoffs of the players? 7. (Generalizing the Chicken Game) Consider the following Chicken Game: A B A Z,Z 0,X B X,0 -Y,-Y Where X>0, Y>0, Z>0, X>Z, and Y>Z. a) What are the Pure Strategy NE of this game? b) What is the Mixed-Strategy Nash Equilibrium (MSNE)? c) How does the MSNE depend on Y, Z, and X? What is the intuition behind this result? d) Derive an expression for the frequency of mismatch between these two players in a MSNE. e) What happens to the probability of achieving the worst outcome (B,B) when the three parameters change? f) Derive an expression for the expected payoff of each player in equilibrium. g) What is the relationship between the parameters and the expected payoffs of the players? What is the intuition behind your result? 8. (The role of commitment) In this problem, you are going to analyze the role of commitment in all Coordination Games (Pure Coordination, Battle of the Sexes, Chicken, and Stag-Hunt). Use the payoff matrices described in problems 4, 5, 6, and 7. The rules are as follows: before the two players play the game being analyzed, they have to play the commitment game, in which each player chooses whether to commit to a particular strategy or not. The commitment is credible, in the sense that there is a technology that enforces the choice made by the players in this first stage. You are only free to choose any strategy in the second stage if you choose not to commit in the first stage. For each type of coordination game, find the Nash Equilibrium and the equilibrium payoffs with and without commitment. When is the possibility of mutual commitment beneficial and when is it harmful? 9. (Chickens go to Washington) Consider a lobbying game between two firms. Each firm may lobby the government in hopes of persuading the government to make a decision that is

4 favorable to the firm. The two firms, X and Y, independently and simultaneously decide whether to lobby (L) or not (N). Lobbying entails a cost of 15. Not lobbying costs nothing. If both firms lobby or neither firm lobbies then the government takes a neutral decision (supposedly the one that maximizes social welfare), which yields 10 to both firms. If firm Y lobbies and firm X does not, then the government makes a decision that favors firm Y, yielding 0 to firm X and 30 to firm Y. If firm X lobbies and firm Y does not, then the government makes a decision that favors firm X, yielding a payoff of x-40 to firm X and 0 to firm Y. Assume that x>25. a) What are the Pure Strategy NE of this game? b) Compute the MSNE. c) Given the mixed-strategy NE computed in part (b), what is the probability that the government makes a decision that favors firm X? d) As x rises, does the probability that the government makes a decision favoring firm X rise or fall? Is this good from an economic standpoint? 10. Consider the following game: L M R U X,X X,0 X,0 C 0,X 2,0 0,2 D 0,X 0,2 2,0 Compute ALL Nash Equilibria. 11. Suppose you know the following about a particular two-player game: S1={A,B,C}, S2={X,Y,Z}, u1(a,x)=6, u1(a,y)=0, and u1(a,z)=0, where S1 and S2 are the strategies available to players 1 and 2, and u1 is the utility that player 1 gets when a specific outcome happens. In addition, suppose you know that the game has a mixed-strategy NE in which (a) the players select each of their strategies with positive probability, (b) player 1 s expected payoff in equilibrium is 4, and (c) player 2 s expected payoff in equilibrium is 6. Calculate the probability that player 2 selects X in equilibrium. 12. (Watson, 2008) The famous British spy 001 has to choose one of four routes, a, b, c, or d (listed in order of speed in good conditions) to ski down a mountain. Fast routes are more likely to be struck by an avalanche. At the same time, the notorious rival spy 002 has to choose whether to use (y) or not to use (n) his valuable explosive device to cause an avalanche. The payoffs of this game are represented here. n Y a 12,0 0,6 b 11,1 1,5 c 10,2 4,2 d 9,3 6,0 Are there any routes you would advise 001 definitely not to take? Explain your answer.

5 A viewer of this epic drama is trying to determine what will happen. Find a NE in which one player plays a pure strategy and the other plays a mixed strategy. Find a different mixed strategy equilibrium in which this same pure strategy is assigned zero probability. Are there any other equilibria? 13. Consider a game with n players. Simultaneously and independently, the players choose between X and Y. The payoff of each player who selects X is 2m 2 x m x 3, where mx is the number of players who choose X. The payoff of each player who selects Y is 4 my, where my is the number of players who choose Y. a) For the case of n=2, find the pure strategy NE; b) Suppose that n=3. What are the pure strategy NE of this game and the MSNE of this game? 14. (The Auditing Game) The goal of the Internal Revenue Service is to either prevent or catch cheating at minimum cost, and it must decide whether to audit a certain class of suspect tax returns to discover whether they are accurate or not. The suspects want to cheat only if they will not be caught. Assume that the benefit of preventing or catching cheating is 4, the cost of auditing is C, where C<4, the cost to the suspects of obeying the law is 1, and the cost of being caught is the fine F>1. If they all move simultaneously, what is the Mixed Strategy Nash equilibrium of this game? Let s say that you found that p=p* and q=q*, where p is the probability that the IRS will audit each person in equilibrium, and q* is the probability that a person will cheat. In this game, what is the difference between auditing each person with probability p* and announcing in advance that a fraction p* of the population will be audited for sure, and the suspects are chosen randomly? 15. Rapoport and Amaldoss (1997) set up a patent race game in which a weak player is given an endowment of 4, any integral amount of which could be invested in a project with a return of 10. However a strong player is given an endowment of 5 and both players are instructed that whichever player invests the most will receive the return of 10 for the patent, and if there is a tie, neither gets the return of 10. What is the mixed strategy equilibrium of this game? What is the payoff of the game for each player? 16. Recall Problem 1 of Problem Set number 3. Now, suppose that general stores can only be set up at locations 0, 1/n,..., (n 1)/n, 1 (multiple stores can occupy the same location). a) What is the mixed strategy Nash equilibrium when n=3? b) What is the mixed strategy Nash equilibrium when n=4? c) What is the mixed strategy Nash equilibrium when n=5? (a software might be necessary) d) What is the mixed strategy Nash equilibrium when n=6? (a software might be necessary) 17. In Santa Fe there is nothing to do at night but look at the stars or go to the local bar, El Farol. Let us define the utility of looking at the stars as 0, and let the cost of walking over to the bar be 1. Suppose the utility from being at the bar is 2 if there is at least one person who does not go to the bar and 1/2 if everybody in Santa Fe goes to the bar. Suppose there are n people in Santa Fe.

6 a) Find the Mixed Strategy Nash Equilibrium of this game. b) What happens to the probability of each person going to the bar as the population increases? Explain. c) What happens to the probability that everybody in Santa Fe goes to the bar as the population increases? Explain. 18. Lucy offers to play the following game with Charlie: Let us show pennies to each other, each choosing heads or tails. If we both show heads, I pay you $X. If we both show tails, I pay you $1. If the two don t match, you pay me $2. What is the largest value of X that Lucy would be willing to pay in the case of both showing heads? 19. You pick a number from 1 to 3. I receive three dollars and I have to guess the number. You respond (truthfully!) by saying high, low, or correct. The game continues until I guess correctly. You receive from me a number of dollars equal to the number of guesses I took. a) What are the Nash strategies for this game? b) How much do you expect to win in this game? c) Find the Nash Equilibrium of a similar game, but with only one difference: you can pick any number from 1 to Each of three firms (1, 2, and 3) uses water from a lake for production purposes. Each has two pure strategies: purify sewage (strategy 1) or divert it back into the lake (strategy 2). We assume that if zero or one firm diverts its sewage into the lake, the water remains pure, but if two or more firms do, the water is impure and each firm suffers a loss of 3. The cost of purification is 1. Find all NE of this game. 21. (Advertising Game) Three firms put three items on the market and can advertise these products either on morning or evening TV. A firm advertises exactly once per day. If more than one firm advertises at the same time, their profits are zero. If exactly one firm advertises in the morning, its profit is 1, and if exactly one firm advertises in the evening, its profit is 2. Firms must make their daily advertising decisions simultaneously. Find all NE of this game. 22. A pedestrian is hit by a car and lies injured on the road. There are n people in the vicinity of the accident. The injured pedestrian requires immediate medical attention, which will be forthcoming if at least one of the n people calls for help. Simultaneously and independently, each of the n bystanders decides whether or not to call for help (by dialing 911 on a cell phone or a pay phone). Each bystander obtains b units of utility if someone (anyone) calls for help. Those who call for help pay a personal cost of c. Find all Nash Equilibria of this game. Then, compute the probability that at least one person calls for help in equilibrium. Imagine now that the 911 policy for emergencies has changed. Because of the increasing number of pranks and false emergency calls, medical attention will be forthcoming only if two people or more call for help. If only one person calls, the pedestrian will not get the necessary medical attention, but this person will pay the personal cost of c. Find all Nash Equilibria of this game.

7 Then, compute the probability that the pedestrian will get medical attention, and compare this result with the previous case. 23. (Silverman s game) Each of two players chooses a positive integer. If player i s integer is greater than player j s integer and less than three times this integer, then player j pays $1 to player i. If player j s integer is at least three times player i s integer, then player i pays $1 to player j. If the integers are equal no payment is made. Each player s preferences are represented by her expected payoff. What is the NE of this game? 24. (The Economics of Crime) A population is divided into potential victims and potential criminals. Victims carry an amount of money equal to m, and when they encounter a criminal, they have to choose either to comply to the mugger s request or to fight. Muggers have to choose either to use a fake gun or a real gun. The victims cannot distinguish between a real gun and a fake gun. It is costless for muggers to acquire fake guns, but real guns have a cost equal to Cg. If a victim complies the mugger always gets the victim s money. If a victim fights the mugger, and the mugger is using a fake gun, assume that the victim does not lose the money and that the mugger is caught by the police and goes to prison, which has a cost of Cp. If a victim fights the mugger, and the mugger is using a real gun, then you will get shot, which has a cost of Cs, and you will lose the money. The mugger escapes with the money. a) Find ALL Nash equilibria of this game; b) If the victim is carrying more money, what will change in equilibrium? Explain. c) If real guns become more expensive, what will change in equilibrium? d) If the penalty for mugging becomes harsher, what will change in equilibrium? e) If real guns become more fatal, what will change in equilibrium? f) Assume that the government wants to minimize the criminal s payoff. What could the government do? g) Now assume that the government just wants to minimize the probability that a victim will get shot. What could the government do to achieve this goal? 25. (Smoking Bans) Two bars have to select simultaneously and independently whether to allow smoking or not. Two customers (one smoker and one non-smoker) observe the choices made by the bars, and then decide simultaneously and independently whether to go to Bar 1 or Bar 2. Obviously, the non-smoker never smokes, regardless of the smoking regime. The smoker always smokes if smoking is allowed, and never smokes if smoking is not allowed. Assume that α is the smoker s benefit of smoking, and β is the non-smoker disutility of having to face the smoke if the smoker is in the same bar and is smoking. The customers also enjoy talking to each other. Specifically, they get a benefit of γ from the social interaction if they happen to select the same bar. Assume that α < β < γ. The customers choose which bar to go in order to maximize their payoffs, and the bars choose the smoking regime to maximize the expected number of customers each day. Social welfare is equal to the sum of the customers expected payoffs. a) Find the Subgame Perfect Nash equilibrium of this two-stage game; b) Is it possible that one bar will allow smoking and the other will not? Explain. c) What happens to the probability of both bars allow smoking when the disutility of smoking increases? Explain.

8 d) If there is one equilibrium in which both bars allow smoking, would a smoking ban increase or decrease welfare? Explain. 26. The host of a TV show asks general knowledge questions on air, and viewers can call the show from their homes to attempt to answer the questions. All callers pay a fee of c, but only one random caller will be selected to participate in the show and be asked to answer the question. There are n people watching the show (assume this is common knowledge), and a correct answer means that the person wins a prize of b. Assume for now that b and c are given, and the producers of the show can only choose the level of difficulty of the question, x. This level can be interpreted as follows: if the level of difficulty of a question is x, then 1-x is the fraction of viewers who know the correct answer to the question. The producers of the TV show want to maximize profit (total revenue generated by the calls minus b in case of a correct answer). a) Assume that all players are rational, in the sense that they know whether they know the correct answer to the question or not. Only those who know the correct answer will think about calling the show (but that does not mean that all of them will call). Find the subgame perfect Nash Equilibrium of this game. b) Is it possible to find the equilibrium if the producers of the show are free to choose b, c, and x simultaneously? c) What if the producers are again only free to choose x, but some viewers are not perfectly rational? Those who know the answer know that they know, and will behave rationally, whereas a fraction y of the viewers who do not know the correct answer will think that they know, even though they do not. And those who do not know but think they know always call. It is plausible to assume that y also depends on x. Feel free to assume a functional form that you think captures the true relationship between y and x, and find the SPNE. 27.(Penalty kicks in soccer) In soccer, if your opponent commits a foul on someone from your team punishable within their own penalty area (also known as the box or the 18 yard box), your team will be awarded with a penalty kick, which is a free kick taken from twelve yards (11 meters) out from your opponent s goal with only the goalkeeper and you (the penalty taker). Due to the short distance between the penalty spot and the goal, there is very little time for the goalkeeper to react to the shot. Because of this, the goalkeeper will usually start his or her dive before the ball is actually struck. In effect, the goalkeeper must act on his or her best prediction about where the shot will be aimed. Model this as a simultaneous game, in which a successful outcome is worth 1 and a bad outcome is worth 0. The payoffs are reversed if the goalkeeper defends the penalty kick. The players have three strategies available to them: Left (L), Middle (M), and Right (R). If they choose different strategies, the kicker will score a goal. If the choose the same strategy, then this means that the goalkeeper guessed correctly. But a correct guess guarantees a successful defense only if they both choose the Middle strategy. Some kickers are so good, that even if the goalkeeper chooses the correct side, it is possible that a goal will be scored. Call the quality of the kicker x, which represents the probability that a goal will be scored when the kicker chooses one of the two sides (Left or Right), and the goalkeeper guesses correctly. Additionally, it is well-known that fans and teammates do not like when the goalkeeper guesses incorrectly by staying in the Middle. This is a well-known psychological

9 propensity called Action Bias. Assume that the magnitude of this bias is c. The payoff matrix then becomes (the kicker is the Row player): Left Middle Right Left x, 1-x 1, -c 1, 0 Middle 1, 0 0, 1 1, 0 Right 1, 0 1, -c x, 1-x a) Find the MSNE. Interpret the results. b) Now assume that the kicker developed a new maneuver called the paradinha, in which the kicker pretends to kick the ball, with the intention of making the goalkeeper jump off to one side, leaving the kicker free to kick the ball into the opposite lower corner for an easy goal. If the goalkeeper jumps off to one side, the paradinha is always successful. If the goalkeeper stays in the middle and the kicker uses the paradinha, then a second stage is initiated. The kicker will have to choose one of the three strategies, and the goalkeeper will wait for the kick and will choose the correct side (the goalkeeper has an incentive to do this now because an unsuccessful paradinha causes the shooter to kick the ball less hard). New parameters have to be added. Assume that αx (where 0 α 1) represents the probability that a goal will be scored when the paradinha was unsuccessful and the shooter chose one of the two sides (a kick to the middle followed by an unsuccessful paradinha will never be a goal). Also, assume that m > 0 is the level of shame that a goalkeeper feels when the paradinha is successful (soccer fans are aware that a goal scored using the paradinha is humiliating for the goalkeeper). The new payoff matrix is: Left Middle Right Left x, 1-x 1, -c 1, 0 Middle 1, 0 0, 1 1, 0 Right 1, 0 1, -c x, 1-x Paradinha 1, -m αx, 1- αx 1, -m Find the MSNE. 28. (Online Dating Market) Let s analyze a simplified version of an online dating market. Two persons have created their profiles on a website. Person 1 is less attractive than Person 2. Person 3 and Person 4 also created profiles, and Person 3 is less attractive than Person 4. Persons 3 and 4 have to ask either Person 1 or Person 2 for a date. The choices are made simultaneously. If only one person asked you, you will date this person. If both Person 3 and Person 4 chose to date you, you will choose to date Person 4, since Person 4 is more attractive. Person 3 gets a payoff of x if he/she dates Person 1, and a payoff of αx if he/she dates Person 2, where α > 1. Person 4 gets a payoff of x if he/she dates Person 2, and a payoff of βx if he/she dates Person 1, where 0 < β < 1. These payoffs are capturing the following preferences: an unattractive person dating another unattractive person generates the same benefit as when an attractive person dates another attractive person; and an unattractive person dating an attractive person is happier than when an attractive person dates an unattractive person (notice that we are only interested in the payoffs of Persons 3 and 4).

10 a) Find the Nash Equilibrium. b) Now assume that Person 5 also has an online profile and is added to the market. He/She also has to choose between Persons 1 and 2. Person 5 has the same level of attractiveness as Person 4 (attractive). The rules are the same for Persons 1 and 2: if only one person chooses them, they will date this person; if more than one person chooses them, they will choose the more attractive one; and if both Person 4 and Person 5 choose you, you will choose one randomly. Find the Nash Equilibrium, and the payoffs in equilibrium. Can Person 3 benefit from the addition of Person 5 to the market? c) Now assume that Person 6 was added to the market, and Person 6 has the same level of attractiveness as Person 3 (so we have two unattractive people and two attractive people). What is the Nash equilibrium now? 29. Consider an all-pay auction for a good worth 1 to each of the two bidders. Each bidder can choose to offer a bid from the unit interval. Players care only about the expected value they will end up with at the end of the game. Find the Nash Equilibrum. What if the number of players is n? Can you find the Nash Equilibrium? 30. A citizen must choose whether to file taxes honestly or to cheat. The tax man decides how much effort to invest in auditing and can choose a [0,1]; the cost to the tax man of investing at a level a is c(a) = 100a 2. If the citizen is honest then he receives the benchmark payoff of 0, and the tax man pays the auditing costs without any benefit from the audit, yielding him a payoff of 100a 2. If the citizen cheats then his payoff depends on whether he is caught. If he is caught then his payoff is -100 and the tax man s payoff is a 2. If he is not caught than his payoff is 50 while the tax man s payoff is 100a 2. If the citizen cheats and the tax man chooses to audit at level a then the citizen is caught with probability a. Find the Nash Equilibrium. 31. Completely categorize the set of correlated equilibria for these games and give one example of a correlated equilibrium for each one of them: GAME 1 A B A 8,0 0,1 B 0,1 1,0 GAME 2 A B A 5,5 0,10 B 10,0 2,2 GAME 3 A B A 3,1 0,0 B 0,0 1,3 GAME 4 A B A 8,8 0,3 B 3,0 3,3

11 GAME 5 A B A 7,7 4,9 B 9,4 0,0 32. Answer the following questions about the five games that were analyzed in question 33: a) Is a Nash Equilibrium also a Correlated Equilibrium? b) Is a Correlated Equilibrium also a Nash Equilibrium? c) Why is the set of correlated strategies larger than the set of mixed strategies? d) For each game, what is the correlated equilibrium that maximizes the sum of the players expected payoffs? e) Now assume that the Coreographer is a good friend of the Row player. Find the correlated equilibrium that maximizes Row s expected payoffs. f) For each game, what is the correlated equilibrium that minimizes the sum of the players expected payoffs? 33. Consider the following game: A B C A 4,3 0,0 1,4 B 0,0 2,1 0,0 A correlated strategy is being implemented in this game. The information given is that (A,B) is chosen by the Coreographer with the same probability as (B,C). What is the maximum probability that the choreographer can choose these two outcomes and that still generates a Correlated Equilibrium? 34. Revisit the game from question 3. For each game, find the efficient correlated equilibrium, i.e., the one that maximizes the sum of expected utilities. 35. (k-rationalizability) Analyze the games from Question 3. For levels of rationality ranging from 0-3 (feel free to assume a plausible non-strategic rule of thumb for the level-0 players), find the outcomes of all those games. 36. (Cognitive Hierarchy) Do the same thing using the Cognitive Hierarchy Model (from levels of rationality ranging from 0-3). Assume that λ = 2. Then, imagine that you are the Row player in each of those games. As a rational player who understands that others may behave irrationally, specify what is the optimal strategy for you.

PROBLEM SET 4 L C R T 5,1 0,0 0,0 M 0,0 1,5 0,0 B 0,0 0,0 2,2 A B C D A 1,1 2,2 3,4 9,3 B 2,5 3,3 1,2 7,1 A B C A 1,3 2,-2 0,6 B 3,2 1,4 5,0

PROBLEM SET 4 L C R T 5,1 0,0 0,0 M 0,0 1,5 0,0 B 0,0 0,0 2,2 A B C D A 1,1 2,2 3,4 9,3 B 2,5 3,3 1,2 7,1 A B C A 1,3 2,-2 0,6 B 3,2 1,4 5,0 PROLEM SET 4 1. What is the Opponent s Indifference Property? 2. When the Opponent s Indifference Property holds, why should a player choose his appropriate mixture, given that any other probability distribution

More information

Microeconomics of Banking: Lecture 4

Microeconomics of Banking: Lecture 4 Microeconomics of Banking: Lecture 4 Prof. Ronaldo CARPIO Oct. 16, 2015 Administrative Stuff Homework 1 is due today at the end of class. I will upload the solutions and Homework 2 (due in two weeks) later

More information

Lecture #3: Networks. Kyumars Sheykh Esmaili

Lecture #3: Networks. Kyumars Sheykh Esmaili Lecture #3: Game Theory and Social Networks Kyumars Sheykh Esmaili Outline Games Modeling Network Traffic Using Game Theory Games Exam or Presentation Game You need to choose between exam or presentation:

More information

Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility

Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility theorem (consistent decisions under uncertainty should

More information

ECO 463. SimultaneousGames

ECO 463. SimultaneousGames ECO 463 SimultaneousGames Provide brief explanations as well as your answers. 1. Two people could benefit by cooperating on a joint project. Each person can either cooperate at a cost of 2 dollars or fink

More information

(a) Left Right (b) Left Right. Up Up 5-4. Row Down 0-5 Row Down 1 2. (c) B1 B2 (d) B1 B2 A1 4, 2-5, 6 A1 3, 2 0, 1

(a) Left Right (b) Left Right. Up Up 5-4. Row Down 0-5 Row Down 1 2. (c) B1 B2 (d) B1 B2 A1 4, 2-5, 6 A1 3, 2 0, 1 Economics 109 Practice Problems 2, Vincent Crawford, Spring 2002 In addition to these problems and those in Practice Problems 1 and the midterm, you may find the problems in Dixit and Skeath, Games of

More information

Econ 302: Microeconomics II - Strategic Behavior. Problem Set #5 June13, 2016

Econ 302: Microeconomics II - Strategic Behavior. Problem Set #5 June13, 2016 Econ 302: Microeconomics II - Strategic Behavior Problem Set #5 June13, 2016 1. T/F/U? Explain and give an example of a game to illustrate your answer. A Nash equilibrium requires that all players are

More information

THEORY: NASH EQUILIBRIUM

THEORY: NASH EQUILIBRIUM THEORY: NASH EQUILIBRIUM 1 The Story Prisoner s Dilemma Two prisoners held in separate rooms. Authorities offer a reduced sentence to each prisoner if he rats out his friend. If a prisoner is ratted out

More information

U strictly dominates D for player A, and L strictly dominates R for player B. This leaves (U, L) as a Strict Dominant Strategy Equilibrium.

U strictly dominates D for player A, and L strictly dominates R for player B. This leaves (U, L) as a Strict Dominant Strategy Equilibrium. Problem Set 3 (Game Theory) Do five of nine. 1. Games in Strategic Form Underline all best responses, then perform iterated deletion of strictly dominated strategies. In each case, do you get a unique

More information

final examination on May 31 Topics from the latter part of the course (covered in homework assignments 4-7) include:

final examination on May 31 Topics from the latter part of the course (covered in homework assignments 4-7) include: The final examination on May 31 may test topics from any part of the course, but the emphasis will be on topic after the first three homework assignments, which were covered in the midterm. Topics from

More information

ECON 282 Final Practice Problems

ECON 282 Final Practice Problems ECON 282 Final Practice Problems S. Lu Multiple Choice Questions Note: The presence of these practice questions does not imply that there will be any multiple choice questions on the final exam. 1. How

More information

The book goes through a lot of this stuff in a more technical sense. I ll try to be plain and clear about it.

The book goes through a lot of this stuff in a more technical sense. I ll try to be plain and clear about it. Economics 352: Intermediate Microeconomics Notes and Sample Questions Chapter 15: Game Theory Models of Pricing The book goes through a lot of this stuff in a more technical sense. I ll try to be plain

More information

Games. Episode 6 Part III: Dynamics. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto

Games. Episode 6 Part III: Dynamics. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Games Episode 6 Part III: Dynamics Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Dynamics Motivation for a new chapter 2 Dynamics Motivation for a new chapter

More information

NORMAL FORM (SIMULTANEOUS MOVE) GAMES

NORMAL FORM (SIMULTANEOUS MOVE) GAMES NORMAL FORM (SIMULTANEOUS MOVE) GAMES 1 For These Games Choices are simultaneous made independently and without observing the other players actions Players have complete information, which means they know

More information

Finance Solutions to Problem Set #8: Introduction to Game Theory

Finance Solutions to Problem Set #8: Introduction to Game Theory Finance 30210 Solutions to Problem Set #8: Introduction to Game Theory 1) Consider the following version of the prisoners dilemma game (Player one s payoffs are in bold): Cooperate Cheat Player One Cooperate

More information

Domination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown

Domination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown Game Theory Week 3 Kevin Leyton-Brown Game Theory Week 3 Kevin Leyton-Brown, Slide 1 Lecture Overview 1 Domination 2 Rationalizability 3 Correlated Equilibrium 4 Computing CE 5 Computational problems in

More information

1\2 L m R M 2, 2 1, 1 0, 0 B 1, 0 0, 0 1, 1

1\2 L m R M 2, 2 1, 1 0, 0 B 1, 0 0, 0 1, 1 Chapter 1 Introduction Game Theory is a misnomer for Multiperson Decision Theory. It develops tools, methods, and language that allow a coherent analysis of the decision-making processes when there are

More information

4/21/2016. Intermediate Microeconomics W3211. Lecture 20: Game Theory 2. The Story So Far. Today. But First.. Introduction

4/21/2016. Intermediate Microeconomics W3211. Lecture 20: Game Theory 2. The Story So Far. Today. But First.. Introduction 1 Intermediate Microeconomics W3211 ecture 20: Game Theory 2 Introduction Columbia University, Spring 2016 Mark Dean: mark.dean@columbia.edu 2 The Story So Far. 3 Today 4 ast lecture we began to study

More information

Computing Nash Equilibrium; Maxmin

Computing Nash Equilibrium; Maxmin Computing Nash Equilibrium; Maxmin Lecture 5 Computing Nash Equilibrium; Maxmin Lecture 5, Slide 1 Lecture Overview 1 Recap 2 Computing Mixed Nash Equilibria 3 Fun Game 4 Maxmin and Minmax Computing Nash

More information

Lecture 6: Basics of Game Theory

Lecture 6: Basics of Game Theory 0368.4170: Cryptography and Game Theory Ran Canetti and Alon Rosen Lecture 6: Basics of Game Theory 25 November 2009 Fall 2009 Scribes: D. Teshler Lecture Overview 1. What is a Game? 2. Solution Concepts:

More information

Terry College of Business - ECON 7950

Terry College of Business - ECON 7950 Terry College of Business - ECON 7950 Lecture 5: More on the Hold-Up Problem + Mixed Strategy Equilibria Primary reference: Dixit and Skeath, Games of Strategy, Ch. 5. The Hold Up Problem Let there be

More information

Mixed Strategies; Maxmin

Mixed Strategies; Maxmin Mixed Strategies; Maxmin CPSC 532A Lecture 4 January 28, 2008 Mixed Strategies; Maxmin CPSC 532A Lecture 4, Slide 1 Lecture Overview 1 Recap 2 Mixed Strategies 3 Fun Game 4 Maxmin and Minmax Mixed Strategies;

More information

Finite games: finite number of players, finite number of possible actions, finite number of moves. Canusegametreetodepicttheextensiveform.

Finite games: finite number of players, finite number of possible actions, finite number of moves. Canusegametreetodepicttheextensiveform. A game is a formal representation of a situation in which individuals interact in a setting of strategic interdependence. Strategic interdependence each individual s utility depends not only on his own

More information

ESSENTIALS OF GAME THEORY

ESSENTIALS OF GAME THEORY ESSENTIALS OF GAME THEORY 1 CHAPTER 1 Games in Normal Form Game theory studies what happens when self-interested agents interact. What does it mean to say that agents are self-interested? It does not necessarily

More information

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Algorithmic Game Theory Date: 12/6/18

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Algorithmic Game Theory Date: 12/6/18 601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Algorithmic Game Theory Date: 12/6/18 24.1 Introduction Today we re going to spend some time discussing game theory and algorithms.

More information

ECON 301: Game Theory 1. Intermediate Microeconomics II, ECON 301. Game Theory: An Introduction & Some Applications

ECON 301: Game Theory 1. Intermediate Microeconomics II, ECON 301. Game Theory: An Introduction & Some Applications ECON 301: Game Theory 1 Intermediate Microeconomics II, ECON 301 Game Theory: An Introduction & Some Applications You have been introduced briefly regarding how firms within an Oligopoly interacts strategically

More information

DECISION MAKING GAME THEORY

DECISION MAKING GAME THEORY DECISION MAKING GAME THEORY THE PROBLEM Two suspected felons are caught by the police and interrogated in separate rooms. Three cases were presented to them. THE PROBLEM CASE A: If only one of you confesses,

More information

Student Name. Student ID

Student Name. Student ID Final Exam CMPT 882: Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte Student Name Student ID Instructions. This exam is worth 30% of your final mark in this course.

More information

EconS Game Theory - Part 1

EconS Game Theory - Part 1 EconS 305 - Game Theory - Part 1 Eric Dunaway Washington State University eric.dunaway@wsu.edu November 8, 2015 Eric Dunaway (WSU) EconS 305 - Lecture 28 November 8, 2015 1 / 60 Introduction Today, we

More information

Introduction to Game Theory I

Introduction to Game Theory I Nicola Dimitri University of Siena (Italy) Rome March-April 2014 Introduction to Game Theory 1/3 Game Theory (GT) is a tool-box useful to understand how rational people choose in situations of Strategic

More information

Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992.

Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992. Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992. Additional readings could be assigned from time to time. They are an integral part of the class and you are expected to read

More information

Prisoner 2 Confess Remain Silent Confess (-5, -5) (0, -20) Remain Silent (-20, 0) (-1, -1)

Prisoner 2 Confess Remain Silent Confess (-5, -5) (0, -20) Remain Silent (-20, 0) (-1, -1) Session 14 Two-person non-zero-sum games of perfect information The analysis of zero-sum games is relatively straightforward because for a player to maximize its utility is equivalent to minimizing the

More information

FIRST PART: (Nash) Equilibria

FIRST PART: (Nash) Equilibria FIRST PART: (Nash) Equilibria (Some) Types of games Cooperative/Non-cooperative Symmetric/Asymmetric (for 2-player games) Zero sum/non-zero sum Simultaneous/Sequential Perfect information/imperfect information

More information

Introduction to Game Theory

Introduction to Game Theory Introduction to Game Theory Lecture 2 Lorenzo Rocco Galilean School - Università di Padova March 2017 Rocco (Padova) Game Theory March 2017 1 / 46 Games in Extensive Form The most accurate description

More information

Economics 201A - Section 5

Economics 201A - Section 5 UC Berkeley Fall 2007 Economics 201A - Section 5 Marina Halac 1 What we learnt this week Basics: subgame, continuation strategy Classes of games: finitely repeated games Solution concepts: subgame perfect

More information

Exploitability and Game Theory Optimal Play in Poker

Exploitability and Game Theory Optimal Play in Poker Boletín de Matemáticas 0(0) 1 11 (2018) 1 Exploitability and Game Theory Optimal Play in Poker Jen (Jingyu) Li 1,a Abstract. When first learning to play poker, players are told to avoid betting outside

More information

Game Theory. 4: Nash equilibrium in different games and mixed strategies

Game Theory. 4: Nash equilibrium in different games and mixed strategies Game Theory 4: Nash equilibrium in different games and mixed strategies Review of lecture three A game with no dominated strategy: The battle of the sexes The concept of Nash equilibrium The formal definition

More information

ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly

ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly Relevant readings from the textbook: Mankiw, Ch. 17 Oligopoly Suggested problems from the textbook: Chapter 17 Questions for

More information

Perfect Bayesian Equilibrium

Perfect Bayesian Equilibrium Perfect Bayesian Equilibrium When players move sequentially and have private information, some of the Bayesian Nash equilibria may involve strategies that are not sequentially rational. The problem is

More information

Game Theory and Randomized Algorithms

Game Theory and Randomized Algorithms Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international

More information

Game theory Computational Models of Cognition

Game theory Computational Models of Cognition Game theory Taxonomy Rational behavior Definitions Common games Nash equilibria Mixed strategies Properties of Nash equilibria What do NE mean? Mutually Assured Destruction 6 rik@cogsci.ucsd.edu Taxonomy

More information

EC3224 Autumn Lecture #02 Nash Equilibrium

EC3224 Autumn Lecture #02 Nash Equilibrium Reading EC3224 Autumn Lecture #02 Nash Equilibrium Osborne Chapters 2.6-2.10, (12) By the end of this week you should be able to: define Nash equilibrium and explain several different motivations for it.

More information

CPS 570: Artificial Intelligence Game Theory

CPS 570: Artificial Intelligence Game Theory CPS 570: Artificial Intelligence Game Theory Instructor: Vincent Conitzer What is game theory? Game theory studies settings where multiple parties (agents) each have different preferences (utility functions),

More information

Dominant Strategies (From Last Time)

Dominant Strategies (From Last Time) Dominant Strategies (From Last Time) Continue eliminating dominated strategies for B and A until you narrow down how the game is actually played. What strategies should A and B choose? How are these the

More information

Game Theory: The Basics. Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)

Game Theory: The Basics. Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943) Game Theory: The Basics The following is based on Games of Strategy, Dixit and Skeath, 1999. Topic 8 Game Theory Page 1 Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)

More information

UPenn NETS 412: Algorithmic Game Theory Game Theory Practice. Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5

UPenn NETS 412: Algorithmic Game Theory Game Theory Practice. Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5 Problem 1 UPenn NETS 412: Algorithmic Game Theory Game Theory Practice Bonnie Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5 This game is called Prisoner s Dilemma. Bonnie and Clyde have been

More information

Game Theory: Basics MICROECONOMICS. Principles and Analysis Frank Cowell

Game Theory: Basics MICROECONOMICS. Principles and Analysis Frank Cowell Game Theory: Basics MICROECONOMICS Principles and Analysis Frank Cowell March 2004 Introduction Focus on conflict and cooperation. Provides fundamental tools for microeconomic analysis. Offers new insights

More information

Partial Answers to the 2005 Final Exam

Partial Answers to the 2005 Final Exam Partial Answers to the 2005 Final Exam Econ 159a/MGT522a Ben Polak Fall 2007 PLEASE NOTE: THESE ARE ROUGH ANSWERS. I WROTE THEM QUICKLY SO I AM CAN'T PROMISE THEY ARE RIGHT! SOMETIMES I HAVE WRIT- TEN

More information

Homework 5 Answers PS 30 November 2013

Homework 5 Answers PS 30 November 2013 Homework 5 Answers PS 30 November 2013 Problems which you should be able to do easily 1. Consider the Battle of the Sexes game below. 1a 2, 1 0, 0 1b 0, 0 1, 2 a. Find all Nash equilibria (pure strategy

More information

Chapter 13. Game Theory

Chapter 13. Game Theory Chapter 13 Game Theory A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes. You can t outrun a bear, scoffs the camper. His friend coolly replies, I don

More information

Game theory. Logic and Decision Making Unit 2

Game theory. Logic and Decision Making Unit 2 Game theory Logic and Decision Making Unit 2 Introduction Game theory studies decisions in which the outcome depends (at least partly) on what other people do All decision makers are assumed to possess

More information

Multi-player, non-zero-sum games

Multi-player, non-zero-sum games Multi-player, non-zero-sum games 4,3,2 4,3,2 1,5,2 4,3,2 7,4,1 1,5,2 7,7,1 Utilities are tuples Each player maximizes their own utility at each node Utilities get propagated (backed up) from children to

More information

Introduction. Begin with basic ingredients of a game. optimisation equilibrium. Frank Cowell: Game Theory Basics. July

Introduction. Begin with basic ingredients of a game. optimisation equilibrium. Frank Cowell: Game Theory Basics. July GAME THEORY: BASICS MICROECONOMICS Principles and Analysis Frank Cowell Note: the detail in slides marked * can only be seen if you run the slideshow July 2017 1 Introduction Focus on conflict and cooperation

More information

Lecture 24. Extensive-Form Dynamic Games

Lecture 24. Extensive-Form Dynamic Games Lecture 4. Extensive-orm Dynamic Games Office Hours this week at usual times: Tue 5:5-6:5, ri - Practice inal Exam available on course website. A Graded Homework is due this Thursday at 7pm. EC DD & EE

More information

ECON 312: Games and Strategy 1. Industrial Organization Games and Strategy

ECON 312: Games and Strategy 1. Industrial Organization Games and Strategy ECON 312: Games and Strategy 1 Industrial Organization Games and Strategy A Game is a stylized model that depicts situation of strategic behavior, where the payoff for one agent depends on its own actions

More information

Game Theory. Vincent Kubala

Game Theory. Vincent Kubala Game Theory Vincent Kubala Goals Define game Link games to AI Introduce basic terminology of game theory Overall: give you a new way to think about some problems What Is Game Theory? Field of work involving

More information

Best Response to Tight and Loose Opponents in the Borel and von Neumann Poker Models

Best Response to Tight and Loose Opponents in the Borel and von Neumann Poker Models Best Response to Tight and Loose Opponents in the Borel and von Neumann Poker Models Casey Warmbrand May 3, 006 Abstract This paper will present two famous poker models, developed be Borel and von Neumann.

More information

Session Outline. Application of Game Theory in Economics. Prof. Trupti Mishra, School of Management, IIT Bombay

Session Outline. Application of Game Theory in Economics. Prof. Trupti Mishra, School of Management, IIT Bombay 36 : Game Theory 1 Session Outline Application of Game Theory in Economics Nash Equilibrium It proposes a strategy for each player such that no player has the incentive to change its action unilaterally,

More information

1. Introduction to Game Theory

1. Introduction to Game Theory 1. Introduction to Game Theory What is game theory? Important branch of applied mathematics / economics Eight game theorists have won the Nobel prize, most notably John Nash (subject of Beautiful mind

More information

Games in Extensive Form, Backward Induction, and Subgame Perfection:

Games in Extensive Form, Backward Induction, and Subgame Perfection: Econ 460 Game Theory Assignment 4 Games in Extensive Form, Backward Induction, Subgame Perfection (Ch. 14,15), Bargaining (Ch. 19), Finitely Repeated Games (Ch. 22) Games in Extensive Form, Backward Induction,

More information

CMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro

CMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro CMU 15-781 Lecture 22: Game Theory I Teachers: Gianni A. Di Caro GAME THEORY Game theory is the formal study of conflict and cooperation in (rational) multi-agent systems Decision-making where several

More information

Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 6 Games and Strategy (ch.4)-continue

Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 6 Games and Strategy (ch.4)-continue Introduction to Industrial Organization Professor: Caixia Shen Fall 014 Lecture Note 6 Games and Strategy (ch.4)-continue Outline: Modeling by means of games Normal form games Dominant strategies; dominated

More information

Solution Concepts 4 Nash equilibrium in mixed strategies

Solution Concepts 4 Nash equilibrium in mixed strategies Solution Concepts 4 Nash equilibrium in mixed strategies Watson 11, pages 123-128 Bruno Salcedo The Pennsylvania State University Econ 402 Summer 2012 Mixing strategies In a strictly competitive situation

More information

PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo

PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the color of the hat of the other two girls, but not the color

More information

PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo

PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the color of the hat of the other two girls, but not the color

More information

Chapter 3 Learning in Two-Player Matrix Games

Chapter 3 Learning in Two-Player Matrix Games Chapter 3 Learning in Two-Player Matrix Games 3.1 Matrix Games In this chapter, we will examine the two-player stage game or the matrix game problem. Now, we have two players each learning how to play

More information

Game Theory. Vincent Kubala

Game Theory. Vincent Kubala Game Theory Vincent Kubala vkubala@cs.brown.edu Goals efine game Link games to AI Introduce basic terminology of game theory Overall: give you a new way to think about some problems What Is Game Theory?

More information

Chapter 15: Game Theory: The Mathematics of Competition Lesson Plan

Chapter 15: Game Theory: The Mathematics of Competition Lesson Plan Chapter 15: Game Theory: The Mathematics of Competition Lesson Plan For All Practical Purposes Two-Person Total-Conflict Games: Pure Strategies Mathematical Literacy in Today s World, 9th ed. Two-Person

More information

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players).

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players). Game Theory Refresher Muriel Niederle February 3, 2009 1. Definition of a Game We start by rst de ning what a game is. A game consists of: A set of players (here for simplicity only 2 players, all generalized

More information

Dynamic Games: Backward Induction and Subgame Perfection

Dynamic Games: Backward Induction and Subgame Perfection Dynamic Games: Backward Induction and Subgame Perfection Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Jun 22th, 2017 C. Hurtado (UIUC - Economics)

More information

CMU-Q Lecture 20:

CMU-Q Lecture 20: CMU-Q 15-381 Lecture 20: Game Theory I Teacher: Gianni A. Di Caro ICE-CREAM WARS http://youtu.be/jilgxenbk_8 2 GAME THEORY Game theory is the formal study of conflict and cooperation in (rational) multi-agent

More information

Non-Cooperative Game Theory

Non-Cooperative Game Theory Notes on Microeconomic Theory IV 3º - LE-: 008-009 Iñaki Aguirre epartamento de Fundamentos del Análisis Económico I Universidad del País Vasco An introduction to. Introduction.. asic notions.. Extensive

More information

Dominant and Dominated Strategies

Dominant and Dominated Strategies Dominant and Dominated Strategies Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Junel 8th, 2016 C. Hurtado (UIUC - Economics) Game Theory On the

More information

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence Multiagent Systems: Intro to Game Theory CS 486/686: Introduction to Artificial Intelligence 1 Introduction So far almost everything we have looked at has been in a single-agent setting Today - Multiagent

More information

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2014 Prof. Michael Kearns percent who will actually attend 100% Attendance Dynamics: Concave equilibrium: 100% percent expected to attend

More information

Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness

Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness March 1, 2011 Summary: We introduce the notion of a (weakly) dominant strategy: one which is always a best response, no matter what

More information

Lecture 23. Offense vs. Defense & Dynamic Games

Lecture 23. Offense vs. Defense & Dynamic Games Lecture 3. Offense vs. Defense & Dynamic Games EC DD & EE / Manove Offense vs Defense p EC DD & EE / Manove Clicker Question p Using Game Theory to Analyze Offense versus Defense In many competitive situations

More information

Introduction to Game Theory. František Kopřiva VŠE, Fall 2009

Introduction to Game Theory. František Kopřiva VŠE, Fall 2009 Introduction to Game Theory František Kopřiva VŠE, Fall 2009 Basic Information František Kopřiva Email: fkopriva@cerge-ei.cz Course webpage: http://home.cerge-ei.cz/kopriva Office hours: Tue 13:00-14:00

More information

Static or simultaneous games. 1. Normal Form and the elements of the game

Static or simultaneous games. 1. Normal Form and the elements of the game Static or simultaneous games 1. Normal Form and the elements of the game Simultaneous games Definition Each player chooses an action without knowing what the others choose. The players move simultaneously.

More information

Analyzing Games: Mixed Strategies

Analyzing Games: Mixed Strategies Analyzing Games: Mixed Strategies CPSC 532A Lecture 5 September 26, 2006 Analyzing Games: Mixed Strategies CPSC 532A Lecture 5, Slide 1 Lecture Overview Recap Mixed Strategies Fun Game Analyzing Games:

More information

Microeconomics II Lecture 2: Backward induction and subgame perfection Karl Wärneryd Stockholm School of Economics November 2016

Microeconomics II Lecture 2: Backward induction and subgame perfection Karl Wärneryd Stockholm School of Economics November 2016 Microeconomics II Lecture 2: Backward induction and subgame perfection Karl Wärneryd Stockholm School of Economics November 2016 1 Games in extensive form So far, we have only considered games where players

More information

Chapter 30: Game Theory

Chapter 30: Game Theory Chapter 30: Game Theory 30.1: Introduction We have now covered the two extremes perfect competition and monopoly/monopsony. In the first of these all agents are so small (or think that they are so small)

More information

CSCI 699: Topics in Learning and Game Theory Fall 2017 Lecture 3: Intro to Game Theory. Instructor: Shaddin Dughmi

CSCI 699: Topics in Learning and Game Theory Fall 2017 Lecture 3: Intro to Game Theory. Instructor: Shaddin Dughmi CSCI 699: Topics in Learning and Game Theory Fall 217 Lecture 3: Intro to Game Theory Instructor: Shaddin Dughmi Outline 1 Introduction 2 Games of Complete Information 3 Games of Incomplete Information

More information

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2016 Prof. Michael Kearns

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2016 Prof. Michael Kearns Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2016 Prof. Michael Kearns Game Theory for Fun and Profit The Beauty Contest Game Write your name and an integer between 0 and 100 Let

More information

Introduction to Auction Theory: Or How it Sometimes

Introduction to Auction Theory: Or How it Sometimes Introduction to Auction Theory: Or How it Sometimes Pays to Lose Yichuan Wang March 7, 20 Motivation: Get students to think about counter intuitive results in auctions Supplies: Dice (ideally per student)

More information

First Prev Next Last Go Back Full Screen Close Quit. Game Theory. Giorgio Fagiolo

First Prev Next Last Go Back Full Screen Close Quit. Game Theory. Giorgio Fagiolo Game Theory Giorgio Fagiolo giorgio.fagiolo@univr.it https://mail.sssup.it/ fagiolo/welcome.html Academic Year 2005-2006 University of Verona Web Resources My homepage: https://mail.sssup.it/~fagiolo/welcome.html

More information

Games of Perfect Information and Backward Induction

Games of Perfect Information and Backward Induction Games of Perfect Information and Backward Induction Economics 282 - Introduction to Game Theory Shih En Lu Simon Fraser University ECON 282 (SFU) Perfect Info and Backward Induction 1 / 14 Topics 1 Basic

More information

PROBLEM SET Explain the difference between mutual knowledge and common knowledge.

PROBLEM SET Explain the difference between mutual knowledge and common knowledge. PROBLEM SET 1 1. Define Pareto Optimality. 2. Explain the difference between mutual knowledge and common knowledge. 3. Define strategy. Why is it possible for a player in a sequential game to have more

More information

4. Game Theory: Introduction

4. Game Theory: Introduction 4. Game Theory: Introduction Laurent Simula ENS de Lyon L. Simula (ENSL) 4. Game Theory: Introduction 1 / 35 Textbook : Prajit K. Dutta, Strategies and Games, Theory and Practice, MIT Press, 1999 L. Simula

More information

Lect 15:Game Theory: the math of competition

Lect 15:Game Theory: the math of competition Lect 15:Game Theory: the math of competition onflict characterized human history. It arises whenever 2 or more individuals, with different values or goals, compete to try to control the course of events.

More information

Introduction to Game Theory

Introduction to Game Theory Introduction to Game Theory Managing with Game Theory Hongying FEI Feihy@i.shu.edu.cn Poker Game ( 2 players) Each player is dealt randomly 3 cards Both of them order their cards as they want Cards at

More information

Introduction Economic Models Game Theory Models Games Summary. Syllabus

Introduction Economic Models Game Theory Models Games Summary. Syllabus Syllabus Contact: kalk00@vse.cz home.cerge-ei.cz/kalovcova/teaching.html Office hours: Wed 7.30pm 8.00pm, NB339 or by email appointment Osborne, M. J. An Introduction to Game Theory Gibbons, R. A Primer

More information

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence Multiagent Systems: Intro to Game Theory CS 486/686: Introduction to Artificial Intelligence 1 1 Introduction So far almost everything we have looked at has been in a single-agent setting Today - Multiagent

More information

UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game Theory I (PR 5) The main ideas

UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game Theory I (PR 5) The main ideas UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game Theory I (PR 5) The main ideas Lectures 5-6 Aug. 29, 2009 Prologue Game theory is about what happens when

More information

INSTRUCTIONS: all the calculations on the separate piece of paper which you do not hand in. GOOD LUCK!

INSTRUCTIONS: all the calculations on the separate piece of paper which you do not hand in. GOOD LUCK! INSTRUCTIONS: 1) You should hand in ONLY THE ANSWERS ASKED FOR written clearly on this EXAM PAPER. You should do all the calculations on the separate piece of paper which you do not hand in. 2) Problems

More information

CS510 \ Lecture Ariel Stolerman

CS510 \ Lecture Ariel Stolerman CS510 \ Lecture04 2012-10-15 1 Ariel Stolerman Administration Assignment 2: just a programming assignment. Midterm: posted by next week (5), will cover: o Lectures o Readings A midterm review sheet will

More information

Arpita Biswas. Speaker. PhD Student (Google Fellow) Game Theory Lab, Dept. of CSA, Indian Institute of Science, Bangalore

Arpita Biswas. Speaker. PhD Student (Google Fellow) Game Theory Lab, Dept. of CSA, Indian Institute of Science, Bangalore Speaker Arpita Biswas PhD Student (Google Fellow) Game Theory Lab, Dept. of CSA, Indian Institute of Science, Bangalore Email address: arpita.biswas@live.in OUTLINE Game Theory Basic Concepts and Results

More information

Game Theory two-person, zero-sum games

Game Theory two-person, zero-sum games GAME THEORY Game Theory Mathematical theory that deals with the general features of competitive situations. Examples: parlor games, military battles, political campaigns, advertising and marketing campaigns,

More information

Lecture 3: Nash Equilibrium

Lecture 3: Nash Equilibrium Microeconomics I: Game Theory Lecture 3: Nash Equilibrium (see Osborne, 2009, Sect 2.1-2.7) Dr. Michael Trost Department of Applied Microeconomics November 8, 2013 Dr. Michael Trost Microeconomics I: Game

More information

Math 464: Linear Optimization and Game

Math 464: Linear Optimization and Game Math 464: Linear Optimization and Game Haijun Li Department of Mathematics Washington State University Spring 2013 Game Theory Game theory (GT) is a theory of rational behavior of people with nonidentical

More information