ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.

Slides:



Advertisements
Similar presentations
Some examples in Cournot Competition
Advertisements

Market Institutions: Oligopoly
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
ECON 100 Tutorial: Week 9 office: LUMS C85.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
© 2009 Institute of Information Management National Chiao Tung University Game theory The study of multiperson decisions Four types of games Static games.
Chapter Twenty-Seven Oligopoly. u A monopoly is an industry consisting a single firm. u A duopoly is an industry consisting of two firms. u An oligopoly.
Infinitely Repeated Games. In an infinitely repeated game, the application of subgame perfection is different - after any possible history, the continuation.
Bayesian Games Yasuhiro Kirihata University of Illinois at Chicago.
ECO290E: Game Theory Lecture 5 Mixed Strategy Equilibrium.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.5.Repeated Games Lecture
Game Theory: Inside Oligopoly
ECO290E: Game Theory Lecture 9 Subgame Perfect Equilibrium.
Industrial Organization - Matilde Machado Tacit Collusion Tacit Collusion Matilde Machado.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
ECO290E: Game Theory Lecture 4 Applications in Industrial Organization.
Economics 202: Intermediate Microeconomic Theory 1.HW #6 on website. Due Thursday. 2.No new reading for Thursday, should be done with Ch 8, up to page.
Dynamic Games of Complete Information.. Repeated games Best understood class of dynamic games Past play cannot influence feasible actions or payoff functions.
Oligopoly Fun and games. Oligopoly An oligopolist is one of a small number of producers in an industry. The industry is an oligopoly.  All oligopolists.
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.
Yale lectures 5 and 6 Nash Equilibrium – no individual can do strictly better by deviating – self enforcing in agreements Investment game – all invest.
Game Theory Lecture Jan 18. In Bertrand’s model of oligopoly A)Each firm chooses its quantity as the best response to the quantity chosen by the other(s).
Harsanyi transformation Players have private information Each possibility is called a type. Nature chooses a type for each player. Probability distribution.
Game theory The study of multiperson decisions Four types of games
Job Market Signaling (Spence model)
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
APEC 8205: Applied Game Theory Fall 2007
Repeated games - example This stage game is played 2 times Any SPNE where players behave differently than in a 1-time game? Player 2 LMR L1, 10, 05, 0.
TOPIC 6 REPEATED GAMES The same players play the same game G period after period. Before playing in one period they perfectly observe the actions chosen.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Extensive Game with Imperfect Information Part I: Strategy and Nash equilibrium.
0 MBA 299 – Section Notes 4/25/03 Haas School of Business, UC Berkeley Rawley.
EC941 - Game Theory Francesco Squintani Lecture 3 1.
This Week’s Topics  Review Class Concepts -Sequential Games -Simultaneous Games -Bertrand Trap -Auctions  Review Homework  Practice Problems.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
© 2009 Institute of Information Management National Chiao Tung University Lecture Notes II-2 Dynamic Games of Complete Information Extensive Form Representation.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
Chapter 9 Games with Imperfect Information Bayesian Games.
© 2009 Institute of Information Management National Chiao Tung University Lecture Note II-3 Static Games of Incomplete Information Static Bayesian Game.
3.1. Strategic Behavior Matilde Machado.
Game Theory (Microeconomic Theory (IV)) Instructor: Yongqin Wang School of Economics and CCES, Fudan University December,
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 4.1.Dynamic Games of Incomplete Information Lecture
Bayes-Nash equilibrium with Incomplete Information.
Games with Imperfect Information Bayesian Games. Complete versus Incomplete Information So far we have assumed that players hold the correct belief about.
Dynamic Games & The Extensive Form
1 Topic 2 (continuation): Oligopoly Juan A. Mañez.
CHAPTER 23 MONOPOLISTIC COMPETITION AND OLIGOPOLY.
Extensive Games with Imperfect Information
Static Games of Incomplete Information
ECO290E: Game Theory Lecture 13 Dynamic Games of Incomplete Information.
Incomplete information: Perfect Bayesian equilibrium
Chapter 6 Extensive Form Games With Perfect Information (Illustrations)
Game Theory (Microeconomic Theory (IV)) Instructor: Yongqin Wang School of Economics, Fudan University December, 2004.
Dynamic games, Stackelburg Cournot and Bertrand
Extensive Form Games With Perfect Information (Illustrations)
CHAPTER 27 OLIGOPOLY.
5.1.Static Games of Incomplete Information
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2009 Lecture 1 A Quick Review of Game Theory and, in particular, Bayesian Games.
Entry Deterrence Players Two firms, entrant and incumbent Order of play Entrant decides to enter or stay out. If entrant enters, incumbent decides to fight.
ECO290E: Game Theory Lecture 10 Examples of Dynamic Games.
Game Theory Georg Groh, WS 08/09 Verteiltes Problemlösen.
1 GAME THEORY AND INDUSTRIAL ECONOMICS (ORGANIZATION) FIRMS’ STRATEGIC BEHAVIOUR Strategic interaction among economic agents (a sort of externality: the.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.1.Dynamic Games of Complete and Perfect Information Lecture
Lecture 7 Price competition. Bertrand’s Model of Oligopoly Strategic variable price rather than output. Single good produced by n firms Cost to firm i.
Dynamic Games of Complete Information
Econ 805 Advanced Micro Theory 1
Games with Imperfect Information Bayesian Games
Chapter 14 & 15 Repeated Games.
Chapter 14 & 15 Repeated Games.
Presentation transcript:

ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information

Review of Lecture 11 In the repeated Bertrand games, the following “trigger” strategies achieve collusion if δ≥1/2. Each firm charges a monopoly price until someone undercuts the price, and after such deviation she will set a price equal to the marginal cost c, i.e., get into a price war. tt+1t+2… collusionπππ… deviation2π2π00…

Finite Repetitions Q: If the Bertrand games are played only finitely, i.e., ends in period T, then collusion can be sustained? A: NO! In the last period (t=T), no firm has an incentive to collude since there is no future play. The only possible outcome is a stage game NE. In the second to the last period (t=T-1), no firm has an incentive to collude since the future play will be a price war no matter how each firm plays in period T- 1. By backward induction, firms end up getting into price wars in every period.  No collusion is possible!

Finitely Repeated Games If the stage game G has a unique NE, then for any T, the finitely repeated game G(T) has a unique SPNE: the NE of G is played in every stage irrespective of the history. If the stage game G has multiple NE, then for any T, any sequence of those equilibrium profiles can be supported as the outcome of a SPNE. Moreover, non-NE strategy profiles can be sustained as a SPNE in this case.

Games of Incomplete Information In a game of incomplete information, at least one player is uncertain about what other players know, i.e., some of the players possess private information, at the beginning of the game. For example, a firm may not know the cost of the rival firm, a bidder does not usually know her competitors’ valuations in an auction. Following Harsanyi (1967), we can translate any game of incomplete information into a Bayesian game in which a NE is naturally extended as a Bayesian Nash equilibrium.

Cournot Game with Unknown Cost Firm 1’s marginal cost is constant (c), while firm 2’s marginal cost takes either high (h) with probability θ or low (l) with probability 1- θ. Firm 1’s strategy is a quantity choice, but firm 2’s strategy is a complete action plan, i.e., she must specify her quantity choice in each possible marginal cost. Assume each firm tries to maximize an expected profit.

Calculation It is important to consider the types of player 2 as separate players. Equilibrium strategies can be derived by the following maximization problems:

Solution Notice that firm 2 will produce more (/less) than she would in the complete information case with high (/low) cost, since firm 1 does not take the best response to firm 2’s actual quantity but maximizes his expected profit.

Static Bayesian Games 1.Nature draws a type vector t, according to a prior probability distribution p(t). 2.Nature reveals i’s type to player i, but not to any other player. 3.The players simultaneously choose actions. 4.Payoffs are received.

Remarks A belief about other players’ types is a conditional probability distribution of other players’ types given the player’s knowledge of her own type. A (pure) strategy for a player is a complete action plan, which specifies her action for each of her possible type. Bayes’ rule:

Bayesian Nash Equilibrium A strategy profile s* is a Bayesian NE if which is equivalent to

Calculation Maximizing RHS is identical to maximizing inside the brackets for all possible i’s type.