Sequential-move games with Nature s moves.

Size: px
Start display at page:

Download "Sequential-move games with Nature s moves."

Transcription

1 Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 3. GAMES WITH SEQUENTIAL MOVES Game trees. Sequential-move games with finite number of decision notes. Sequential-move games with Nature s moves. 1

2 Strategies in sequential-move games. A strategy as a complete plan. List of all strategies for each player in a sequential-move games. Rollback method and rollback equilibrium. Mark game tree to find rollback equilibrium (not just equilibrium outcome). Find all rollback equilibria when there are ties. 2

3 CHAPTER 4. SIMULTANENOUS-MOVE GAMES: DISCRETE STRATEGIES Game tables. Simultaneous-move games with two players and finite number of strategies for each player. Strict dominance. One strategy strictly dominates another strategy for a given player. A strictly dominant strategy for a given player. 3

4 Iterated elimination of strictly dominated strategies. Games solvable through iterated elimination of strictly dominated strategies. Weak dominance. One strategy weakly dominates another strategy for a given player. A weakly dominant strategy for a given player. Iterated elimination of weakly dominated strategies. 4

5 Pure-strategy Nash equilibrium. Find all Nash equilibria using best response analysis in game tables. Only strategies surviving iterated elimination of strictly dominated strategies can be part of Nash equilibrium. Players may use weakly dominated strategies in some Nash equilibria. 5

6 CHAPTER 5. SIMULTANENOUS-MOVE GAMES: CONTINUOUS STRATEGIES Best response function. Derive best response function. Find all Nash equilibria by solving the simultaneous equations given by best response functions. Illustrate in a diagram Nash equilibria as intersections of best response functions. 6

7 Rationalizability. Find rationalizable strategies in a simultaneous-move game through iterated elimination of never best responses. Nash equilibrium strategies are rationalizable. Strictly dominated strategies are never best responses, but never best responses may not be strictly dominated. 7

8 CHAPTER 6. COMBING SEQUENTIAL AND SIMULTANENOUS MOVES Information set. Use information set in game trees to represent games with both sequential and simultaneous moves. Degenerate versus non-degenerate information sets. Adapt strategy as a complete plan to information sets. 8

9 Nash equilibrium. Derive strategic form from extensive form (game tree) by listing all strategies, and find all Nash equilibria. Verify Nash equilibrium without using strategic form. Subgame prefect equilibrium. Subgames in games that combine sequential moves and simultaneous moves. Subgame perfect equilibrium forms a Nash equilibrium in every subgame. 9

10 Find all subgame perfect equilibria by combining rollback method with Nash equilibrium. Find all subgame perfect equilibrium outcomes. With multiple Nash equilibria in some subgames, each Nash equilibrium requires a separate rollback and yields a different subgame perfect equilibrium. 10

11 Subgame perfect equilibrium and Nash equilibrium. In sequential-move games, subgame perfect equilibrium is same as rollback equilibrium. In simultaneous-move games, subgame perfect Nash equilibrium is same as Nash equilibrium. Nash equilibrium in a game with sequential moves (with or without sequential moves) is not subgame perfect if it does not form a Nash equilibrium in some subgame. 11

12 CHAPTER 7. SIMULTANEOUS-MOVE GAMES: MIXED STRATEGIES Mixed strategies. A mixed strategy of a given player assigns a probability number to each of the player s pure strategies, with the total probabilities equal to 1. Pure strategy as a degenerate mixed strategy. 12

13 Expected payoffs in presence of independent mixing. Compute expected payoff to each player. Expected payoff to a player using a mixed strategy is probability-weighted sum of expected payoffs using the player s pure strategies, with probability for each pure strategy given by player s mixed strategy. 13

14 Mixed-strategy Nash equilibrium. For simultaneous-move games with two players and two pure strategies for each player, find all the Nash equilibria, in pure strategies and in mixed strategies, by finding each player s best response in mixed strategy against the opponent s mixed strategies, and illustrate in a diagram. 14

15 General indifference principle for finding Nash equilibrium involving mixing, when some players have more than two pure strategies, and when there are more than two players. A player uses a mixed strategy in a Nash equilibrium if and only if, against equilibrium strategies used by other players, the player is indifferent among all pure strategies used in the mixing, and weakly prefers each of them to any pure strategy not used in mixing. Use general indifference principle to verify mixed-strategy Nash equilibrium. 15

16 CHAPTER 8. UNCERTAINTY AND INFORMATION Uncertain prospect. An uncertain prospect is a random number, represented by a probability assigned to each possible prospect, with probabilities summing up to 1. Expected prospect of an uncertain prospect is probabilityweighted sum of possible prospects. 16

17 Risk-neutrality. A player is risk-neutral if the expected payoff from any uncertain prospect depends only on the expected prospect. For risk-neutral player, payoff from getting the expected prospect of any uncertain prospect with probability 1 equals expected payoff from uncertain prospect itself. Expected prospect can be used to represent payoff of a risk-neutral player. 17

18 Risk-aversion. A player is risk-averse if payoff from getting expected prospect of any uncertain prospect with probability 1 exceeds expected payoff from uncertain prospect itself. For a risk-averse player, the certainty equivalent of an uncertain prospect, defined as a certain prospect that gives player same expected payoff as the uncertain prospect, is lower than expected prospect. 18

19 Risk-aversion and concave payoff function. A risk-averse player uses a concave function to convert prospects into payoffs. For uncertain prospects with only two possible prospects, illustrate expected prospect and certainty equivalence under a concave payoff function. 19

20 Adverse selection and other simultaneous-move games with asymmetric information. Private information of an informed player is represented by this player having multiple possible types from the point of view of an uninformed player. An uninformed player knows only the probability of each possible type. Represent such games in a game tree using Nature s move at beginning of game and information sets. 20

21 Bayesian Nash equilibrium. Strategy of informed player specifies a choice for each possible type; strategy of uninformed player specifies a single choice. Strategies of informed player and uninformed player form best responses to each other in a Bayesian Nash equilibrium: for an informed player, this requires best responding by each type, while for an uninformed player, this requires maximizing expected payoff. 21

22 Cheap talk, signaling and other games with sequential moves and asymmetric information. Private information of an informed player is represented by this player having multiple possible types; uninformed player knows only prior probability of each possible type. Informed player moves first; uninformed player observed the move but not type of informed player. Represent such games in a game tree using Nature s move at beginning of game and information sets. 22

23 Beliefs of uninformed player about type of informed player. To best respond, uninformed player must hold a belief after each possible first move of the informed player (information set). A belief at an information set assigned a probability to each possible type of informed player. Derive belief from strategy of informed player using Bayes rule. 23

24 Perfect Bayesian equilibrium specifies first move by each type of informed player, strategy of uninformed player, and belief at each information set, such that: Each type of informed player best responds. Uninformed player best responds at each information set given the belief. For information set reached with positive probability according to strategy of informed player (on the path), belief is derived from informed player s strategy using Bayes rule. 24

25 Two types of perfect Bayesian equilibrium. In separating equilibrium, different types of informed player make different first moves, so uninformed player s belief at any information set on the path puts all the probability on corresponding type. In pooling equilibrium, different types of informed player make same first move, so uninformed player s belief at the only information set on the path is same as prior. 25

26 CHAPTER 10. THE PRISONERS DILEMMA AND REPEATED GAMES Repeated Prisoners Dilemma. General formulation of stage game: Defect is strictly dominant, but both players are better off if both instead choose Cooperate. Discounting: each player s payoff is discounted sum of stage game payoffs, with same discount factor between 0 and 1. 26

27 Finite repetition. Use rollback method to show unique subgame perfect equilibrium is each player playing Defect in each round regardless of the outcomes in previous rounds. Repetition alone does not induce cooperation. Infinite repetition. Rollback method no longer applies. Compute payoff from a discounted sum of an infinite sequence of payoffs from stage games. 27

28 Sustain cooperation through a pair of trigger strategies in infinitely repeated Prisoners Dilemma. Trigger strategy. Find the critical value of discount factor above which cooperation can sustained. 28

29 CHAPTER 11. COLLECTIVE-ACTION GAMES General formulation. Simultaneous-move games by many identical players, each choosing between participation and shirking. Two payoff functions represent payoff to each player from each choice as function of number of participants. 29

30 Nash equilibrium is a number of participants such that, given the number, each participant weakly prefers to participate and each non-participant weakly prefers to shirk. One of the two Nash equilibrium conditions is absent if all participate, or if all shirk. Find all Nash equilibria using the two payoff functions, and illustrate in a diagram. 30

31 Social optimum. Social payoff function is sum of payoffs to participants and non-participants, as a function of the number of participants. Social optimum is the number of participants which maximizes social payoff function. 31

32 Spillovers. Spillovers are difference between marginal private gain, which is change in a player s payoff when the player switches to participation, and marginal social gain, which is change in social payoff function when the number of participants increases by 1. Use the two payoff functions to derive an expression for spillovers. Spillovers explain why Nash equilibria can differ from social optimum. 32

33 Mixed-strategy Nash equilibria in collective-action games. There is no need for coordination in mixed-strategy Nash equilibria. An example: use the indifference principle to find the mixed-strategy Nash equilibrium in collective Game of Chicken. 33

34 CHAPTER 13. MECHANISM DESIGN Mechanism design in general adverse selection problems (hidden information). Principal wishes to separate different types of agent. Incentive condition: each type of agent is willing to choose the option intended for that type. Participation condition: each type of agent weakly prefers to participate in the mechanism instead of opting out. 34

35 Price discrimination with two types of buyer. Price-quality menu when seller observes buyer s type (full-information mechanism) does not satisfy incentive condition for type with a greater marginal valuation for quality (high type). Seller can satisfy incentive condition for high type by reducing price for high type in full-information menu, but can achieve the same with a smaller reduction, and thus increase profits, by reducing quality and price for the other type (low type). 35

36 Mechanism design under moral hazard (hidden action). Principal wants agent to take particular action. Incentive condition: agent is wiling to take the desired action. Participation condition: agent must weakly prefer to participate in the mechanism instead of opting out. 36

37 Wage contract with a risk-averse worker and two possible outputs. Full-insurance for worker when firm observes whether worker exerts effort or not, but it violates the incentive condition because effort is costly to worker. Firm can satisfy incentive condition, and thus increase profits, by linking wage to output. 37

38 CHAPTER 15. STRATEGY AND VOTING Condorcet paradox. The example with three voters and three options. Majority preferences are intransitive even though all the individual preferences are transitive. There is no Condorcet winner: no option beats every other option in majority voting. 38

39 Agenda paradox. With three or more options, agenda specifies procedure of how multi-stage pairwise voting takes place. With three options, there are three agendas: each agenda specifies which two options of the three are voted on in first round, with the winner and the third option voted on in second round. In same example of Condorcet paradox, three agendas produce three different eventual winners. 39

40 Reversal paradox. Borda counts. A cardinal method of aggregating individual preferences, so transitivity is ensured. Reversal paradox: ranking between two options can depend on whether a third option is available or not. 40

41 Voting under a fixed agenda with Condorcet example. Manipulation of votes: sincere voting is not a subgame perfect equilibrium. Find subgame perfect equilibrium using rollback and Nash equilibrium in subgames that do not involve weakly dominated strategies. 41

42 Median voter theorem. Single-peaked preferences. Median positions and median voters. Median voter theorem: if two parties only care about winning, then in any subgame perfect equilibrium that do not involve weakly dominated strategies, the two parties each propose a median position. 42

43 CHAPTER 16. BIDDING STRATEGY AND AUCTION DESIGN Second price, sealed bid auctions with private values. Bidding one s own valuation is weakly dominant. First price, sealed bid auctions with private values. Bidding one s own valuation is weakly dominated by bidding below it, so is bidding above it, but there is no weakly dominant bidding strategy. Equilibrium bidding strategy involves shading the bid, i.e., bidding below one s own valuation. 43

44 Verify Bayesian Nash equilibrium in two-bidder, sealed-bid, first-price auction with private values. Each bidder s type is own private valuation, which the other bidder believe is uniformly distributed on [0, 1]. Equilibrium: bid half of own valuation. Compute the expected payoff to a bidder with a fixed valuation as a function of any bid between 0 and 1, against equilibrium bidding strategy of the opponent, and show this expected payoff is maximized by a bid equal to half of the valuation. 44

45 Winner s curse. General formulation of common values: each bidder s valuation is weighted sum of one s own estimate and estimates of opponents, which the bidder does not know. Winner s curse: in any Bayesian Nash equilibrium of the auction where equilibrium bid increases with one s own estimate, winning the auction means rival bidders have low estimates, which reduces bidder s valuation upon winning the auction. 45

46 CHAPTER 17. BARGAINING Two players bargain over how to split up a pie of total value of 1, with each player having outside option of 0, and payoff equal to own share of pie. Binding, split-the-difference arbitration. Find all Nash equilibria. There is no breakdown (except for one equilibrium where each player demands the whole pie) or arbitration in any equilibrium. 46

47 Ultimatum with continuous strategies for proposer. Unique subgame perfect equilibrium. There is no breakdown, and the proposer has all the bargaining power. Alternating offers with pie decaying to 0 at constant rate. Find the unique subgame perfect equilibrium for small number of rounds, using rollback and induction. There is no breakdown or decay, and final proposer gets only half of the pie. 47

48 Alternating offers with common discount factor. Find the unique subgame perfect equilibrium for small number of rounds, using rollback and induction. There is no breakdown or delay. There are both final-proposer advantage and first-mover advantage. 48

Games with incomplete information about players. be symmetric or asymmetric.

Games with incomplete information about players. be symmetric or asymmetric. Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 8. UNCERTAINTY AND INFORMATION Games with incomplete information about players. Incomplete information about players preferences can be symmetric or asymmetric.

More information

Now we return to simultaneous-move games. We resolve the issue of non-existence of Nash equilibrium. in pure strategies through intentional mixing.

Now we return to simultaneous-move games. We resolve the issue of non-existence of Nash equilibrium. in pure strategies through intentional mixing. Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 7. SIMULTANEOUS-MOVE GAMES: MIXED STRATEGIES Now we return to simultaneous-move games. We resolve the issue of non-existence of Nash equilibrium in pure strategies

More information

The Ohio State University Department of Economics Econ 601 Prof. James Peck Extra Practice Problems Answers (for final)

The Ohio State University Department of Economics Econ 601 Prof. James Peck Extra Practice Problems Answers (for final) The Ohio State University Department of Economics Econ 601 Prof. James Peck Extra Practice Problems Answers (for final) Watson, Chapter 15, Exercise 1(part a). Looking at the final subgame, player 1 must

More information

HW Consider the following game:

HW Consider the following game: HW 1 1. Consider the following game: 2. HW 2 Suppose a parent and child play the following game, first analyzed by Becker (1974). First child takes the action, A 0, that produces income for the child,

More information

Auction is a commonly used way of allocating indivisible

Auction is a commonly used way of allocating indivisible Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 16. BIDDING STRATEGY AND AUCTION DESIGN Auction is a commonly used way of allocating indivisible goods among interested buyers. Used cameras, Salvator Mundi, and

More information

Simon Fraser University Spring 2014

Simon Fraser University Spring 2014 Simon Fraser University Spring 2014 Econ 302 D200 Final Exam Solution This brief solution guide does not have the explanations necessary for full marks. NE = Nash equilibrium, SPE = subgame perfect equilibrium,

More information

Extensive-Form Games with Imperfect Information

Extensive-Form Games with Imperfect Information May 6, 2015 Example 2, 2 A 3, 3 C Player 1 Player 1 Up B Player 2 D 0, 0 1 0, 0 Down C Player 1 D 3, 3 Extensive-Form Games With Imperfect Information Finite No simultaneous moves: each node belongs to

More information

(a) (5 points) Suppose p = 1. Calculate all the Nash Equilibria of the game. Do/es the equilibrium/a that you have found maximize social utility?

(a) (5 points) Suppose p = 1. Calculate all the Nash Equilibria of the game. Do/es the equilibrium/a that you have found maximize social utility? GAME THEORY EXAM (with SOLUTIONS) January 20 P P2 P3 P4 INSTRUCTIONS: Write your answers in the space provided immediately after each question. You may use the back of each page. The duration of this exam

More information

Economics 502 April 3, 2008

Economics 502 April 3, 2008 Second Midterm Answers Prof. Steven Williams Economics 502 April 3, 2008 A full answer is expected: show your work and your reasoning. You can assume that "equilibrium" refers to pure strategies unless

More information

Economics 171: Final Exam

Economics 171: Final Exam Question 1: Basic Concepts (20 points) Economics 171: Final Exam 1. Is it true that every strategy is either strictly dominated or is a dominant strategy? Explain. (5) No, some strategies are neither dominated

More information

CONTRACT THEORY. Patrick Bolton and Mathias Dewatripont. The MIT Press Cambridge, Massachusetts London, England

CONTRACT THEORY. Patrick Bolton and Mathias Dewatripont. The MIT Press Cambridge, Massachusetts London, England r CONTRACT THEORY Patrick Bolton and Mathias Dewatripont The MIT Press Cambridge, Massachusetts London, England Preface xv 1 Introduction 1 1.1 Optimal Employment Contracts without Uncertainty, Hidden

More information

Econ 101A Final exam May 14, 2013.

Econ 101A Final exam May 14, 2013. Econ 101A Final exam May 14, 2013. Do not turn the page until instructed to. Do not forget to write Problems 1 in the first Blue Book and Problems 2, 3 and 4 in the second Blue Book. 1 Econ 101A Final

More information

Introduction to Multi-Agent Programming

Introduction to Multi-Agent Programming Introduction to Multi-Agent Programming 10. Game Theory Strategic Reasoning and Acting Alexander Kleiner and Bernhard Nebel Strategic Game A strategic game G consists of a finite set N (the set of players)

More information

Econ 101A Final exam May 14, 2013.

Econ 101A Final exam May 14, 2013. Econ 101A Final exam May 14, 2013. Do not turn the page until instructed to. Do not forget to write Problems 1 in the first Blue Book and Problems 2, 3 and 4 in the second Blue Book. 1 Econ 101A Final

More information

University of Hong Kong

University of Hong Kong University of Hong Kong ECON6036 Game Theory and Applications Problem Set I 1 Nash equilibrium, pure and mixed equilibrium 1. This exercise asks you to work through the characterization of all the Nash

More information

Microeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 2017

Microeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 2017 Microeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 07. (40 points) Consider a Cournot duopoly. The market price is given by q q, where q and q are the quantities of output produced

More information

Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 2017

Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 2017 Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 017 1. Sheila moves first and chooses either H or L. Bruce receives a signal, h or l, about Sheila s behavior. The distribution

More information

G5212: Game Theory. Mark Dean. Spring 2017

G5212: Game Theory. Mark Dean. Spring 2017 G5212: Game Theory Mark Dean Spring 2017 Bargaining We will now apply the concept of SPNE to bargaining A bit of background Bargaining is hugely interesting but complicated to model It turns out that the

More information

Games of Incomplete Information ( 資訊不全賽局 ) Games of Incomplete Information

Games of Incomplete Information ( 資訊不全賽局 ) Games of Incomplete Information 1 Games of Incomplete Information ( 資訊不全賽局 ) Wang 2012/12/13 (Lecture 9, Micro Theory I) Simultaneous Move Games An Example One or more players know preferences only probabilistically (cf. Harsanyi, 1976-77)

More information

1 x i c i if x 1 +x 2 > 0 u i (x 1,x 2 ) = 0 if x 1 +x 2 = 0

1 x i c i if x 1 +x 2 > 0 u i (x 1,x 2 ) = 0 if x 1 +x 2 = 0 Game Theory - Midterm Examination, Date: ctober 14, 017 Total marks: 30 Duration: 10:00 AM to 1:00 PM Note: Answer all questions clearly using pen. Please avoid unnecessary discussions. In all questions,

More information

An introduction on game theory for wireless networking [1]

An introduction on game theory for wireless networking [1] An introduction on game theory for wireless networking [1] Ning Zhang 14 May, 2012 [1] Game Theory in Wireless Networks: A Tutorial 1 Roadmap 1 Introduction 2 Static games 3 Extensive-form games 4 Summary

More information

Microeconomics II. CIDE, MsC Economics. List of Problems

Microeconomics II. CIDE, MsC Economics. List of Problems Microeconomics II CIDE, MsC Economics List of Problems 1. There are three people, Amy (A), Bart (B) and Chris (C): A and B have hats. These three people are arranged in a room so that B can see everything

More information

Microeconomics of Banking: Lecture 5

Microeconomics of Banking: Lecture 5 Microeconomics of Banking: Lecture 5 Prof. Ronaldo CARPIO Oct. 23, 2015 Administrative Stuff Homework 2 is due next week. Due to the change in material covered, I have decided to change the grading system

More information

Lecture 5 Leadership and Reputation

Lecture 5 Leadership and Reputation Lecture 5 Leadership and Reputation Reputations arise in situations where there is an element of repetition, and also where coordination between players is possible. One definition of leadership is that

More information

Game Theory. Wolfgang Frimmel. Repeated Games

Game Theory. Wolfgang Frimmel. Repeated Games Game Theory Wolfgang Frimmel Repeated Games 1 / 41 Recap: SPNE The solution concept for dynamic games with complete information is the subgame perfect Nash Equilibrium (SPNE) Selten (1965): A strategy

More information

Final Examination December 14, Economics 5010 AF3.0 : Applied Microeconomics. time=2.5 hours

Final Examination December 14, Economics 5010 AF3.0 : Applied Microeconomics. time=2.5 hours YORK UNIVERSITY Faculty of Graduate Studies Final Examination December 14, 2010 Economics 5010 AF3.0 : Applied Microeconomics S. Bucovetsky time=2.5 hours Do any 6 of the following 10 questions. All count

More information

ECON106P: Pricing and Strategy

ECON106P: Pricing and Strategy ECON106P: Pricing and Strategy Yangbo Song Economics Department, UCLA June 30, 2014 Yangbo Song UCLA June 30, 2014 1 / 31 Game theory Game theory is a methodology used to analyze strategic situations in

More information

Game Theory: Additional Exercises

Game Theory: Additional Exercises Game Theory: Additional Exercises Problem 1. Consider the following scenario. Players 1 and 2 compete in an auction for a valuable object, for example a painting. Each player writes a bid in a sealed envelope,

More information

Today. Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction

Today. Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction Today Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction 2 / 26 Auctions Used to allocate: Art Government bonds Radio spectrum Forms: Sequential

More information

UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016

UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016 UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016 More on strategic games and extensive games with perfect information Block 2 Jun 11, 2017 Auctions results Histogram of

More information

Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 5 Games and Strategy (Ch. 4)

Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 5 Games and Strategy (Ch. 4) Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 5 Games and Strategy (Ch. 4) Outline: Modeling by means of games Normal form games Dominant strategies; dominated strategies,

More information

Microeconomic Theory II Spring 2016 Final Exam Solutions

Microeconomic Theory II Spring 2016 Final Exam Solutions Microeconomic Theory II Spring 206 Final Exam Solutions Warning: Brief, incomplete, and quite possibly incorrect. Mikhael Shor Question. Consider the following game. First, nature (player 0) selects t

More information

Lecture 3 Representation of Games

Lecture 3 Representation of Games ecture 3 epresentation of Games 4. Game Theory Muhamet Yildiz oad Map. Cardinal representation Expected utility theory. Quiz 3. epresentation of games in strategic and extensive forms 4. Dominance; dominant-strategy

More information

ECO303: Intermediate Microeconomic Theory Benjamin Balak, Spring 2008

ECO303: Intermediate Microeconomic Theory Benjamin Balak, Spring 2008 ECO303: Intermediate Microeconomic Theory Benjamin Balak, Spring 2008 Game Theory: FINAL EXAMINATION 1. Under a mixed strategy, A) players move sequentially. B) a player chooses among two or more pure

More information

In the Name of God. Sharif University of Technology. Graduate School of Management and Economics

In the Name of God. Sharif University of Technology. Graduate School of Management and Economics In the Name of God Sharif University of Technology Graduate School of Management and Economics Microeconomics (for MBA students) 44111 (1393-94 1 st term) - Group 2 Dr. S. Farshad Fatemi Game Theory Game:

More information

Economics 209A Theory and Application of Non-Cooperative Games (Fall 2013) Repeated games OR 8 and 9, and FT 5

Economics 209A Theory and Application of Non-Cooperative Games (Fall 2013) Repeated games OR 8 and 9, and FT 5 Economics 209A Theory and Application of Non-Cooperative Games (Fall 2013) Repeated games OR 8 and 9, and FT 5 The basic idea prisoner s dilemma The prisoner s dilemma game with one-shot payoffs 2 2 0

More information

In Class Exercises. Problem 1

In Class Exercises. Problem 1 In Class Exercises Problem 1 A group of n students go to a restaurant. Each person will simultaneously choose his own meal but the total bill will be shared amongst all the students. If a student chooses

More information

Advanced Microeconomics

Advanced Microeconomics Advanced Microeconomics ECON5200 - Fall 2014 Introduction What you have done: - consumers maximize their utility subject to budget constraints and firms maximize their profits given technology and market

More information

w E(Q w) w/100 E(Q w) w/

w E(Q w) w/100 E(Q w) w/ 14.03 Fall 2000 Problem Set 7 Solutions Theory: 1. If used cars sell for $1,000 and non-defective cars have a value of $6,000, then all cars in the used market must be defective. Hence the value of a defective

More information

Player 2 L R M H a,a 7,1 5,0 T 0,5 5,3 6,6

Player 2 L R M H a,a 7,1 5,0 T 0,5 5,3 6,6 Question 1 : Backward Induction L R M H a,a 7,1 5,0 T 0,5 5,3 6,6 a R a) Give a definition of the notion of a Nash-Equilibrium! Give all Nash-Equilibria of the game (as a function of a)! (6 points) b)

More information

Simon Fraser University Fall Econ 302 D200 Final Exam Solution Instructor: Songzi Du Wednesday December 16, 2015, 8:30 11:30 AM

Simon Fraser University Fall Econ 302 D200 Final Exam Solution Instructor: Songzi Du Wednesday December 16, 2015, 8:30 11:30 AM Simon Fraser University Fall 2015 Econ 302 D200 Final Exam Solution Instructor: Songzi Du Wednesday December 16, 2015, 8:30 11:30 AM NE = Nash equilibrium, SPE = subgame perfect equilibrium, PBE = perfect

More information

CUR 412: Game Theory and its Applications, Lecture 4

CUR 412: Game Theory and its Applications, Lecture 4 CUR 412: Game Theory and its Applications, Lecture 4 Prof. Ronaldo CARPIO March 22, 2015 Homework #1 Homework #1 will be due at the end of class today. Please check the website later today for the solutions

More information

Duopoly models Multistage games with observed actions Subgame perfect equilibrium Extensive form of a game Two-stage prisoner s dilemma

Duopoly models Multistage games with observed actions Subgame perfect equilibrium Extensive form of a game Two-stage prisoner s dilemma Recap Last class (September 20, 2016) Duopoly models Multistage games with observed actions Subgame perfect equilibrium Extensive form of a game Two-stage prisoner s dilemma Today (October 13, 2016) Finitely

More information

January 26,

January 26, January 26, 2015 Exercise 9 7.c.1, 7.d.1, 7.d.2, 8.b.1, 8.b.2, 8.b.3, 8.b.4,8.b.5, 8.d.1, 8.d.2 Example 10 There are two divisions of a firm (1 and 2) that would benefit from a research project conducted

More information

Answers to Problem Set 4

Answers to Problem Set 4 Answers to Problem Set 4 Economics 703 Spring 016 1. a) The monopolist facing no threat of entry will pick the first cost function. To see this, calculate profits with each one. With the first cost function,

More information

GAME THEORY. Department of Economics, MIT, Follow Muhamet s slides. We need the following result for future reference.

GAME THEORY. Department of Economics, MIT, Follow Muhamet s slides. We need the following result for future reference. 14.126 GAME THEORY MIHAI MANEA Department of Economics, MIT, 1. Existence and Continuity of Nash Equilibria Follow Muhamet s slides. We need the following result for future reference. Theorem 1. Suppose

More information

G5212: Game Theory. Mark Dean. Spring 2017

G5212: Game Theory. Mark Dean. Spring 2017 G5212: Game Theory Mark Dean Spring 2017 Why Game Theory? So far your microeconomic course has given you many tools for analyzing economic decision making What has it missed out? Sometimes, economic agents

More information

ECON 803: MICROECONOMIC THEORY II Arthur J. Robson Fall 2016 Assignment 9 (due in class on November 22)

ECON 803: MICROECONOMIC THEORY II Arthur J. Robson Fall 2016 Assignment 9 (due in class on November 22) ECON 803: MICROECONOMIC THEORY II Arthur J. Robson all 2016 Assignment 9 (due in class on November 22) 1. Critique of subgame perfection. 1 Consider the following three-player sequential game. In the first

More information

10.1 Elimination of strictly dominated strategies

10.1 Elimination of strictly dominated strategies Chapter 10 Elimination by Mixed Strategies The notions of dominance apply in particular to mixed extensions of finite strategic games. But we can also consider dominance of a pure strategy by a mixed strategy.

More information

ECE 586BH: Problem Set 5: Problems and Solutions Multistage games, including repeated games, with observed moves

ECE 586BH: Problem Set 5: Problems and Solutions Multistage games, including repeated games, with observed moves University of Illinois Spring 01 ECE 586BH: Problem Set 5: Problems and Solutions Multistage games, including repeated games, with observed moves Due: Reading: Thursday, April 11 at beginning of class

More information

FDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015.

FDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015. FDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015.) Hints for Problem Set 2 1. Consider a zero-sum game, where

More information

Microeconomics I. Undergraduate Programs in Business Administration and Economics

Microeconomics I. Undergraduate Programs in Business Administration and Economics Microeconomics I Undergraduate Programs in Business Administration and Economics Academic year 2011-2012 Second test 1st Semester January 11, 2012 Fernando Branco (fbranco@ucp.pt) Fernando Machado (fsm@ucp.pt)

More information

Microeconomic Theory August 2013 Applied Economics. Ph.D. PRELIMINARY EXAMINATION MICROECONOMIC THEORY. Applied Economics Graduate Program

Microeconomic Theory August 2013 Applied Economics. Ph.D. PRELIMINARY EXAMINATION MICROECONOMIC THEORY. Applied Economics Graduate Program Ph.D. PRELIMINARY EXAMINATION MICROECONOMIC THEORY Applied Economics Graduate Program August 2013 The time limit for this exam is four hours. The exam has four sections. Each section includes two questions.

More information

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program August 2017

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program August 2017 Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program August 2017 The time limit for this exam is four hours. The exam has four sections. Each section includes two questions.

More information

Econ 101A Final Exam We May 9, 2012.

Econ 101A Final Exam We May 9, 2012. Econ 101A Final Exam We May 9, 2012. You have 3 hours to answer the questions in the final exam. We will collect the exams at 2.30 sharp. Show your work, and good luck! Problem 1. Utility Maximization.

More information

CUR 412: Game Theory and its Applications Final Exam Ronaldo Carpio Jan. 13, 2015

CUR 412: Game Theory and its Applications Final Exam Ronaldo Carpio Jan. 13, 2015 CUR 41: Game Theory and its Applications Final Exam Ronaldo Carpio Jan. 13, 015 Instructions: Please write your name in English. This exam is closed-book. Total time: 10 minutes. There are 4 questions,

More information

Not 0,4 2,1. i. Show there is a perfect Bayesian equilibrium where player A chooses to play, player A chooses L, and player B chooses L.

Not 0,4 2,1. i. Show there is a perfect Bayesian equilibrium where player A chooses to play, player A chooses L, and player B chooses L. Econ 400, Final Exam Name: There are three questions taken from the material covered so far in the course. ll questions are equally weighted. If you have a question, please raise your hand and I will come

More information

ECONS 424 STRATEGY AND GAME THEORY MIDTERM EXAM #2 ANSWER KEY

ECONS 424 STRATEGY AND GAME THEORY MIDTERM EXAM #2 ANSWER KEY ECONS 44 STRATEGY AND GAE THEORY IDTER EXA # ANSWER KEY Exercise #1. Hawk-Dove game. Consider the following payoff matrix representing the Hawk-Dove game. Intuitively, Players 1 and compete for a resource,

More information

Spring 2017 Final Exam

Spring 2017 Final Exam Spring 07 Final Exam ECONS : Strategy and Game Theory Tuesday May, :0 PM - 5:0 PM irections : Complete 5 of the 6 questions on the exam. You will have a minimum of hours to complete this final exam. No

More information

Econ 804 with Shih En January 10, 2012

Econ 804 with Shih En January 10, 2012 Econ 804 with Shih En January 10, 2012 Dynamic Games Review Multi-stage games with observed actions with observed actions requires that at the end of each stage, the players observe what everyone else

More information

Econ 711 Homework 1 Solutions

Econ 711 Homework 1 Solutions Econ 711 Homework 1 s January 4, 014 1. 1 Symmetric, not complete, not transitive. Not a game tree. Asymmetric, not complete, transitive. Game tree. 1 Asymmetric, not complete, transitive. Not a game tree.

More information

CS711 Game Theory and Mechanism Design

CS711 Game Theory and Mechanism Design CS711 Game Theory and Mechanism Design Problem Set 1 August 13, 2018 Que 1. [Easy] William and Henry are participants in a televised game show, seated in separate booths with no possibility of communicating

More information

1 Solutions to Homework 4

1 Solutions to Homework 4 1 Solutions to Homework 4 1.1 Q1 Let A be the event that the contestant chooses the door holding the car, and B be the event that the host opens a door holding a goat. A is the event that the contestant

More information

CUR 412: Game Theory and its Applications, Lecture 4

CUR 412: Game Theory and its Applications, Lecture 4 CUR 412: Game Theory and its Applications, Lecture 4 Prof. Ronaldo CARPIO March 27, 2015 Homework #1 Homework #1 will be due at the end of class today. Please check the website later today for the solutions

More information

In reality; some cases of prisoner s dilemma end in cooperation. Game Theory Dr. F. Fatemi Page 219

In reality; some cases of prisoner s dilemma end in cooperation. Game Theory Dr. F. Fatemi Page 219 Repeated Games Basic lesson of prisoner s dilemma: In one-shot interaction, individual s have incentive to behave opportunistically Leads to socially inefficient outcomes In reality; some cases of prisoner

More information

M.Phil. Game theory: Problem set II. These problems are designed for discussions in the classes of Week 8 of Michaelmas term. 1

M.Phil. Game theory: Problem set II. These problems are designed for discussions in the classes of Week 8 of Michaelmas term. 1 M.Phil. Game theory: Problem set II These problems are designed for discussions in the classes of Week 8 of Michaelmas term.. Private Provision of Public Good. Consider the following public good game:

More information

In the Name of God. Sharif University of Technology. Microeconomics 2. Graduate School of Management and Economics. Dr. S.

In the Name of God. Sharif University of Technology. Microeconomics 2. Graduate School of Management and Economics. Dr. S. In the Name of God Sharif University of Technology Graduate School of Management and Economics Microeconomics 2 44706 (1394-95 2 nd term) - Group 2 Dr. S. Farshad Fatemi Chapter 8: Simultaneous-Move Games

More information

Iterated Dominance and Nash Equilibrium

Iterated Dominance and Nash Equilibrium Chapter 11 Iterated Dominance and Nash Equilibrium In the previous chapter we examined simultaneous move games in which each player had a dominant strategy; the Prisoner s Dilemma game was one example.

More information

Preliminary Notions in Game Theory

Preliminary Notions in Game Theory Chapter 7 Preliminary Notions in Game Theory I assume that you recall the basic solution concepts, namely Nash Equilibrium, Bayesian Nash Equilibrium, Subgame-Perfect Equilibrium, and Perfect Bayesian

More information

6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts

6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts 6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts Asu Ozdaglar MIT February 9, 2010 1 Introduction Outline Review Examples of Pure Strategy Nash Equilibria

More information

Francesco Nava Microeconomic Principles II EC202 Lent Term 2010

Francesco Nava Microeconomic Principles II EC202 Lent Term 2010 Answer Key Problem Set 1 Francesco Nava Microeconomic Principles II EC202 Lent Term 2010 Please give your answers to your class teacher by Friday of week 6 LT. If you not to hand in at your class, make

More information

Chapter 8. Repeated Games. Strategies and payoffs for games played twice

Chapter 8. Repeated Games. Strategies and payoffs for games played twice Chapter 8 epeated Games 1 Strategies and payoffs for games played twice Finitely repeated games Discounted utility and normalized utility Complete plans of play for 2 2 games played twice Trigger strategies

More information

Game theory and applications: Lecture 1

Game theory and applications: Lecture 1 Game theory and applications: Lecture 1 Adam Szeidl September 20, 2018 Outline for today 1 Some applications of game theory 2 Games in strategic form 3 Dominance 4 Nash equilibrium 1 / 8 1. Some applications

More information

Economics 109 Practice Problems 1, Vincent Crawford, Spring 2002

Economics 109 Practice Problems 1, Vincent Crawford, Spring 2002 Economics 109 Practice Problems 1, Vincent Crawford, Spring 2002 P1. Consider the following game. There are two piles of matches and two players. The game starts with Player 1 and thereafter the players

More information

MA200.2 Game Theory II, LSE

MA200.2 Game Theory II, LSE MA200.2 Game Theory II, LSE Answers to Problem Set [] In part (i), proceed as follows. Suppose that we are doing 2 s best response to. Let p be probability that player plays U. Now if player 2 chooses

More information

Agenda. Game Theory Matrix Form of a Game Dominant Strategy and Dominated Strategy Nash Equilibrium Game Trees Subgame Perfection

Agenda. Game Theory Matrix Form of a Game Dominant Strategy and Dominated Strategy Nash Equilibrium Game Trees Subgame Perfection Game Theory 1 Agenda Game Theory Matrix Form of a Game Dominant Strategy and Dominated Strategy Nash Equilibrium Game Trees Subgame Perfection 2 Game Theory Game theory is the study of a set of tools that

More information

Rationalizable Strategies

Rationalizable Strategies Rationalizable Strategies Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Jun 1st, 2015 C. Hurtado (UIUC - Economics) Game Theory On the Agenda 1

More information

ECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games

ECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games University of Illinois Fall 2018 ECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games Due: Tuesday, Sept. 11, at beginning of class Reading: Course notes, Sections 1.1-1.4 1. [A random

More information

AS/ECON 2350 S2 N Answers to Mid term Exam July time : 1 hour. Do all 4 questions. All count equally.

AS/ECON 2350 S2 N Answers to Mid term Exam July time : 1 hour. Do all 4 questions. All count equally. AS/ECON 2350 S2 N Answers to Mid term Exam July 2017 time : 1 hour Do all 4 questions. All count equally. Q1. Monopoly is inefficient because the monopoly s owner makes high profits, and the monopoly s

More information

Problem Set 3: Suggested Solutions

Problem Set 3: Suggested Solutions Microeconomics: Pricing 3E00 Fall 06. True or false: Problem Set 3: Suggested Solutions (a) Since a durable goods monopolist prices at the monopoly price in her last period of operation, the prices must

More information

Introduction to Game Theory Lecture Note 5: Repeated Games

Introduction to Game Theory Lecture Note 5: Repeated Games Introduction to Game Theory Lecture Note 5: Repeated Games Haifeng Huang University of California, Merced Repeated games Repeated games: given a simultaneous-move game G, a repeated game of G is an extensive

More information

Consider the following (true) preference orderings of 4 agents on 4 candidates.

Consider the following (true) preference orderings of 4 agents on 4 candidates. Part 1: Voting Systems Consider the following (true) preference orderings of 4 agents on 4 candidates. Agent #1: A > B > C > D Agent #2: B > C > D > A Agent #3: C > B > D > A Agent #4: D > C > A > B Assume

More information

Notes on Auctions. Theorem 1 In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy.

Notes on Auctions. Theorem 1 In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy. Notes on Auctions Second Price Sealed Bid Auctions These are the easiest auctions to analyze. Theorem In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy. Proof

More information

Notes for Section: Week 7

Notes for Section: Week 7 Economics 160 Professor Steven Tadelis Stanford University Spring Quarter, 004 Notes for Section: Week 7 Notes prepared by Paul Riskind (pnr@stanford.edu). spot errors or have questions about these notes.

More information

FDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015.

FDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015. FDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015.) Hints for Problem Set 3 1. Consider the following strategic

More information

Name. FINAL EXAM, Econ 171, March, 2015

Name. FINAL EXAM, Econ 171, March, 2015 Name FINAL EXAM, Econ 171, March, 2015 There are 9 questions. Answer any 8 of them. Good luck! Remember, you only need to answer 8 questions Problem 1. (True or False) If a player has a dominant strategy

More information

Topics in Contract Theory Lecture 1

Topics in Contract Theory Lecture 1 Leonardo Felli 7 January, 2002 Topics in Contract Theory Lecture 1 Contract Theory has become only recently a subfield of Economics. As the name suggest the main object of the analysis is a contract. Therefore

More information

Bayesian Nash Equilibrium

Bayesian Nash Equilibrium Bayesian Nash Equilibrium We have already seen that a strategy for a player in a game of incomplete information is a function that specifies what action or actions to take in the game, for every possibletypeofthatplayer.

More information

Strategy -1- Strategy

Strategy -1- Strategy Strategy -- Strategy A Duopoly, Cournot equilibrium 2 B Mixed strategies: Rock, Scissors, Paper, Nash equilibrium 5 C Games with private information 8 D Additional exercises 24 25 pages Strategy -2- A

More information

Auctions. Agenda. Definition. Syllabus: Mansfield, chapter 15 Jehle, chapter 9

Auctions. Agenda. Definition. Syllabus: Mansfield, chapter 15 Jehle, chapter 9 Auctions Syllabus: Mansfield, chapter 15 Jehle, chapter 9 1 Agenda Types of auctions Bidding behavior Buyer s maximization problem Seller s maximization problem Introducing risk aversion Winner s curse

More information

Repeated Games. Econ 400. University of Notre Dame. Econ 400 (ND) Repeated Games 1 / 48

Repeated Games. Econ 400. University of Notre Dame. Econ 400 (ND) Repeated Games 1 / 48 Repeated Games Econ 400 University of Notre Dame Econ 400 (ND) Repeated Games 1 / 48 Relationships and Long-Lived Institutions Business (and personal) relationships: Being caught cheating leads to punishment

More information

Microeconomic Theory II Preliminary Examination Solutions

Microeconomic Theory II Preliminary Examination Solutions Microeconomic Theory II Preliminary Examination Solutions 1. (45 points) Consider the following normal form game played by Bruce and Sheila: L Sheila R T 1, 0 3, 3 Bruce M 1, x 0, 0 B 0, 0 4, 1 (a) Suppose

More information

Game Theory. Important Instructions

Game Theory. Important Instructions Prof. Dr. Anke Gerber Game Theory 2. Exam Summer Term 2012 Important Instructions 1. There are 90 points on this 90 minutes exam. 2. You are not allowed to use any material (books, lecture notes etc.).

More information

Microeconomic Theory (501b) Comprehensive Exam

Microeconomic Theory (501b) Comprehensive Exam Dirk Bergemann Department of Economics Yale University Microeconomic Theory (50b) Comprehensive Exam. (5) Consider a moral hazard model where a worker chooses an e ort level e [0; ]; and as a result, either

More information

Exercises Solutions: Game Theory

Exercises Solutions: Game Theory Exercises Solutions: Game Theory Exercise. (U, R).. (U, L) and (D, R). 3. (D, R). 4. (U, L) and (D, R). 5. First, eliminate R as it is strictly dominated by M for player. Second, eliminate M as it is strictly

More information

Basic Game-Theoretic Concepts. Game in strategic form has following elements. Player set N. (Pure) strategy set for player i, S i.

Basic Game-Theoretic Concepts. Game in strategic form has following elements. Player set N. (Pure) strategy set for player i, S i. Basic Game-Theoretic Concepts Game in strategic form has following elements Player set N (Pure) strategy set for player i, S i. Payoff function f i for player i f i : S R, where S is product of S i s.

More information

CUR 412: Game Theory and its Applications, Lecture 12

CUR 412: Game Theory and its Applications, Lecture 12 CUR 412: Game Theory and its Applications, Lecture 12 Prof. Ronaldo CARPIO May 24, 2016 Announcements Homework #4 is due next week. Review of Last Lecture In extensive games with imperfect information,

More information

Introduction to Political Economy Problem Set 3

Introduction to Political Economy Problem Set 3 Introduction to Political Economy 14.770 Problem Set 3 Due date: Question 1: Consider an alternative model of lobbying (compared to the Grossman and Helpman model with enforceable contracts), where lobbies

More information

EC 308 Question Set # 1

EC 308 Question Set # 1 EC 308 Question Set #. Consider the following game: There are 2 steps. In Step Player chooses between throwing unit of his own payoff (strategy T) or not (strategy N). Observing his action in Step 2 they

More information

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2017

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2017 Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2017 The time limit for this exam is four hours. The exam has four sections. Each section includes two questions.

More information