Strategy -1- Strategy

Similar documents
Strategy -1- Strategic equilibrium in auctions

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

Bayesian Nash Equilibrium

Games with Private Information 資訊不透明賽局

Problem Set 3: Suggested Solutions

Auction is a commonly used way of allocating indivisible

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

Economics Honors Exam 2009 Solutions: Microeconomics, Questions 1-2

Econ 101A Final exam May 14, 2013.

Notes for Section: Week 7

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

CUR 412: Game Theory and its Applications, Lecture 4

CUR 412: Game Theory and its Applications, Lecture 4

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

Econ 101A Final exam May 14, 2013.

Microeconomics Comprehensive Exam

The Ohio State University Department of Economics Second Midterm Examination Answers

1 Theory of Auctions. 1.1 Independent Private Value Auctions

HW Consider the following game:

Noncooperative Market Games in Normal Form

In Class Exercises. Problem 1

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

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

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

MA300.2 Game Theory 2005, LSE

Microeconomics II. CIDE, MsC Economics. List of Problems

ECON Microeconomics II IRYNA DUDNYK. Auctions.

March 30, Why do economists (and increasingly, engineers and computer scientists) study auctions?

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017

Math 135: Answers to Practice Problems

x. The saver is John Riley 7 December 2016 Econ 401a Final Examination Sketch of answers 1. Choice over time Then Adding,

Chapter 10: Mixed strategies Nash equilibria, reaction curves and the equality of payoffs theorem

Elements of Economic Analysis II Lecture XI: Oligopoly: Cournot and Bertrand Competition

Francesco Nava Microeconomic Principles II EC202 Lent Term 2010

Lecture #6: Auctions: Theory and Applications. Prof. Dr. Sven Seuken

When one firm considers changing its price or output level, it must make assumptions about the reactions of its rivals.

Optimal Auctions. Game Theory Course: Jackson, Leyton-Brown & Shoham

Oligopoly Games and Voting Games. Cournot s Model of Quantity Competition:

S 2,2-1, x c C x r, 1 0,0

MA200.2 Game Theory II, LSE

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

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

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

Bayesian games and their use in auctions. Vincent Conitzer

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

Answer Key for M. A. Economics Entrance Examination 2017 (Main version)

Microeconomics III. Oligopoly prefacetogametheory (Mar 11, 2012) School of Economics The Interdisciplinary Center (IDC), Herzliya

Problem Set 3: Suggested Solutions

Answers to Microeconomics Prelim of August 24, In practice, firms often price their products by marking up a fixed percentage over (average)

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012

Simon Fraser University Spring 2014

CS711 Game Theory and Mechanism Design

Mechanism Design and Auctions

Mixed Strategies. In the previous chapters we restricted players to using pure strategies and we

Auctions: Types and Equilibriums

Advanced Microeconomics

ECO 426 (Market Design) - Lecture 9

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

MA200.2 Game Theory II, LSE

Solution Problem Set 2

Chapter 11: Dynamic Games and First and Second Movers

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

ISSN BWPEF Uninformative Equilibrium in Uniform Price Auctions. Arup Daripa Birkbeck, University of London.

On Existence of Equilibria. Bayesian Allocation-Mechanisms

PAULI MURTO, ANDREY ZHUKOV

PAULI MURTO, ANDREY ZHUKOV. If any mistakes or typos are spotted, kindly communicate them to

Auction Theory: Some Basics

Game Theory: Additional Exercises

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

EC 202. Lecture notes 14 Oligopoly I. George Symeonidis

Economics 171: Final Exam

PhD Qualifier Examination

University of Hong Kong

Microeconomics II. CIDE, Spring 2011 List of Problems

Chapter 3. Dynamic discrete games and auctions: an introduction

Exercise Chapter 10

EconS Games with Incomplete Information II and Auction Theory

Lecture Notes on Anticommons T. Bergstrom, April 2010 These notes illustrate the problem of the anticommons for one particular example.

UCLA Department of Economics Ph.D. Preliminary Exam Industrial Organization Field Exam (Spring 2010) Use SEPARATE booklets to answer each question

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

CUR 412: Game Theory and its Applications, Lecture 9

Outline for today. Stat155 Game Theory Lecture 13: General-Sum Games. General-sum games. General-sum games. Dominated pure strategies

Introduction to Political Economy Problem Set 3

Econ 101A Final exam Th 15 December. Do not turn the page until instructed to.

Lecture 9: Basic Oligopoly Models

Economics 101A (Lecture 21) Stefano DellaVigna

Game Theory with Applications to Finance and Marketing, I

UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Fall 2012

ECON106P: Pricing and Strategy

This is page 5 Printer: Opaq

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

GS/ECON 5010 Answers to Assignment 3 November 2005

by open ascending bid ("English") auction Auctioneer raises asking price until all but one bidder drops out

October An Equilibrium of the First Price Sealed Bid Auction for an Arbitrary Distribution.

DUOPOLY. MICROECONOMICS Principles and Analysis Frank Cowell. July 2017 Frank Cowell: Duopoly. Almost essential Monopoly

Challenge to Hotelling s Principle of Minimum

ECON/MGMT 115. Industrial Organization

Multiunit Auctions: Package Bidding October 24, Multiunit Auctions: Package Bidding

Networks: Fall 2010 Homework 3 David Easley and Jon Kleinberg Due in Class September 29, 2010

Ideal Bootstrapping and Exact Recombination: Applications to Auction Experiments

Transcription:

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 Cournot Duopoly Two firms produce related products Demands are linear q 60 20 p 0 p2, q2 50 0 p 20 p2 The demand price functions are as follows: p 9 q q, p 2 q q 5 30 2 2 30 5 2 The cost of production in firm is C ( q ) 4q and in firm 2 is C2( q2) 7q2 Cournot (842) Firm : Computes its marginal revenue and adjusts its output until MR ( q, q2) MC 4 R ( q) p ( q) q 9q q q q 2 6 30 2 R MR 9 q q 2 5 30 2 q

Strategy -3- Firm then chooses q to satisfy MR MC 9 q q 4 2 5 30 2 5 q q 2 5 30 2 0 Therefore q ( q ) 37 2 4 q 2 2 Best response function q( q 2) is firm s best (ie profit-maximizing) response for any choice by firm 2 We can similarly derive firm 2 s best response function q2( q ) Exercise: Show that q2( q ) 37 2 4 q

Strategy -4- The two best response lines are depicted Cournot visualized an adjustment process With each firm adjusting to the other as depicted Note that the adjustment process converges to a q ( q, q ) where * * * 2 q ( q ) q and * * 2 q ( q ) q * * 2 2 At this point the strategy if the firms are said to be mutual best responses Then the stable outcome of this adjustment process satisfies the two first order conditions q ( q, q ) 0 2 2 and ( q, q2) 0 q 2

Strategy -5- B Rock Scissors Paper Suppose that the game is to be played 00 times for $20 per round A pure strategy is a choice from the set of possible actions A { a, a2, a3} { R, S, P} A mixed strategy p ( p, p2, p3) places positive probability on at least two of these actions The probabilities are positive and sum to one Suppose that player 2 adopts the strategy 2 p ( p, p2, p3) ***

Strategy -6- B Rock Scissors Paper Suppose that the game is to be played 00 times for $20 per round A pure strategy is a choice from the set of possible actions A { a, a2, a3} { R, S, P} A mixed strategy p ( p, p2, p3) places positive probability on at least two of these actions The probabilities are positive and sum to one Suppose that player 2 adopts the strategy 2 p ( p, p2, p3) Player s expected payoffs are as follows: U ( a ) 20( p p ) 2 3 U ( a ) 20( p p ) 2 3 U ( a ) 20( p p ) 3 2 **

Strategy -7- B Rock Scissors Paper Suppose that the game is to be played 00 times for $20 per round A pure strategy is a choice from the set of possible actions A { a, a2, a3} { R, S, P} A mixed strategy p ( p, p2, p3) places positive probability on at least two of these actions The probabilities are positive and sum to one Suppose that player 2 adopts the strategy 2 p ( p, p2, p3) Player s expected payoffs are as follows: U ( a ) 20( p p ) 2 3 U ( a ) 20( p p ) 2 3 U ( a ) 20( p p ) 3 2 It is easy to see that if p (,, ), then player s payoff is the same (zero) for all three strategies 2 3 3 3 Then * p (,, ) is a best response to 3 3 3 p (,, ) 2 3 3 3

Strategy -8- B Rock Scissors Paper Suppose that the game is to be played 00 times for $20 per round A pure strategy is a choice from the set of possible actions A { a, a2, a3} { R, S, P} A mixed strategy p ( p, p2, p3) places positive probability on at least two of these actions The probabilities are positive and sum to one Suppose that player 2 adopts the strategy 2 p ( p, p2, p3) Player s expected payoffs are as follows: U ( a ) 20( p p ) 2 3 U ( a ) 20( p p ) 2 3 U ( a ) 20( p p ) 3 2 It is easy to see that if p (,, ), then player s payoff is the same (zero) for all three strategies 2 3 3 3 Then p (,, ) is a best response to 3 3 3 p (,, ) 2 3 3 3 By a symmetric argument, mutual best responses p (,, ) is a best response to 2 3 3 3 p (,, ) So the strategies are 3 3 3

Strategy -9- Suppose instead that p (,, ) Then 2 3 3 3 U ( a ) 20( p p ) 20( ) 2 3 U ( a ) 20( p p ) 20( ) 2 3 U ( a ) 20( p p ) 20(2 ) 3 2 **

Strategy -0- Suppose instead that p (,, ) Then 2 3 3 3 U ( a ) 20( p p ) 20( ) 2 3 U ( a ) 20( p p ) 20( ) 2 3 U ( a ) 20( p p ) 20(2 ) 3 2 So player s best response is p for all 0 (0,0,) Thus the dynamic process underlying Cournot s solution concept does not converge to the mutual best response outcome *

Strategy -- Suppose instead that p (,, ) Then 2 3 3 3 U ( a ) 20( p p ) 20( ) 2 3 U ( a ) 20( p p ) 20( ) 2 3 U ( a ) 20( p p ) 20(2 ) 3 2 So player s best response is p for all 0 (0,0,) Thus the dynamic process underlying Cournot s solution concept does not converge to the mutual best response outcome Despite this is does seem a very reasonable outcome In modern economic modelling of strategy, economists solve for the mutual best response outcome and remain silent as to how it might be learned/discovered

Strategy -2- Nash equilibrium Let S i be the set of feasible strategies (pure or mixed) for player i I {,, I} The strategies s i S i and Nash Equilibrium strategies if they are mutual best response strategies That is, for each i and strategies of the other players, s ( s,, s, s,, s ), i i i I s i is a best response for player i

Strategy -3- C A game with private information Sealed bid auction There are I bidders Each of the buyers may submit a non-negative sealed bid **

Strategy -4- C A game with private information Sealed bid auction There are I bidders Each of the buyers may submit a non-negative sealed bid Allocation rule Bidder i with bid b i loses if another bid is higher If there are m bidders who submit the tying high bid, the winner is selected randomly from one of these high bidders so that win probability of each such bidder is /m *

Strategy -5- C A game with private information Sealed bid auction There are I bidders Each of the buyers may submit a non-negative sealed bid Allocation rule Bidder i with bid b i loses if another bid is higher If there are m bidders who submit the tying high bid, the winner is selected randomly from one of these high bidders so that win probability of each such bidder is /m Payment rule (i) Sealed high-bid auction The winner pays his or her bid Losers pay nothing (ii) Sealed second-bid auction The winner pays the highest of the losing bids (the second highest bid)

Strategy -6- The model Private information: Each buyer s value is private information ****

Strategy -7- The model Private information: Each buyer s value is private information Common knowledge: It is common knowledge that buyer i s value is an independent random draw from a continuous distribution We define F( ) Pr{ v i } This is called the cumulative distribution function (cdf) ***

Strategy -8- The model Private information: Each buyer s value is private information Common knowledge: It is common knowledge that buyer i s value is an independent random draw from a continuous distribution We define F( ) Pr{ v i } This is called the cumulative distribution function (cdf) The derivative, f( ) F ( ), is called the probability density function (pdf) **

Strategy -9- The model Private information: Each buyer s value is private information Common knowledge: It is common knowledge that buyer i s value is an independent random draw from a continuous distribution We define F( ) Pr{ v i } This is called the cumulative distribution function (cdf) The derivative, f( ) F ( ), is called the probability density function (pdf) The values: The values lie on an interval [0, ] *

Strategy -20- The model Private information: Each buyer s value is private information Common knowledge: It is common knowledge that buyer i s value is an independent random draw from a continuous distribution We define F( ) Pr{ v i } This is called the cumulative distribution function (cdf) The derivative, f( ) F ( ), is called the probability density function (pdf) The values: The values lie on an interval [, ] Pure strategy With private information a pure strategy is a mapping b B( ) from every possible value (ie every i into a non-negative bid i i i Bayesian Nash Equilibrium (BNE) strategies: With private information mutual best response strategies are called Bayesian Nash Equilibrium strategies

Strategy -2- An example: Sealed high-bid auction bidders We first examine the special case of a uniform distribution in which the values lie in the interval [0, ] i F( ) Pr( v i ) 00 As we shall see, there is an equilibrium in which the bidding strategies are linear B( ) k, i I {,, I} i i With two bidders the equilibrium bid function is B( ) Method: To check whether any proposed pair of strategies are mutual best response (BNE) strategies all we need to do is show that they are mutual best responses i 2 i

Strategy -22- Step : Equilibrium win probability W() b We use the proposed equilibrium strategy of buyer 2 to obtain the equilibrium win probability for buyer If buyer bids b he wins if b b and loses if b2 2 2 2 b Since the tie occurs with probability zero, the win probability is W ( b) Pr{ b b} 2 Since b B( ) the win probability is 2 2 2 2 W ( b) Pr { b} Pr{ 2b} F( 2b) 2 2 2 For the uniform case, F( ) 00 Therefore 2b W ( b) F(2 b) 00

Strategy -23- Step 2: Solve for buyer s best response Buyer s expected payoff is the win probability Wb () multiplied by the profit if she wins, b 2b 2 2 u(, b) W ( b)( b) ( b) ( b b ) 00 00 u 2 (, b) ( 2 b) b 00 0, if b 2 Therefore buyer s best response to buyer 2 s proposed strategy B ( ) is the strategy 2 2 2 2 B ( ) 2 By an identical argument, B ( ) is a best response to B ( ) Therefore the pair of strategies 2 2 2 2 2 { B ( )} { ( )} 2 2 i i i 2 i i are mutual best responses

Strategy -24- D Exercises: Pricing game If a firm cannot change its capacity quickly then the quantity setting model makes sense But what if capacity can be easily changed Then a firm can lower a price and still guarantee delivery, or raise a price and sell off unused capacity C ( q ) c q where c 4 and c2 7 Demands are f f f f q 60 20 p 0 p2, q2 50 0 p 20 p2 Then the profit of firm f is ( p, q ( p)) p q ( p) C ( q ( p)) ( p c ) q ( p) f f f f f f f f f f (a) For each firm solve for the best response function p b ( q2) and p2 b2 ( p ) (b) Depict these in a neat figure What are the equilibrium prices in this game? (c) If firm 2 produces nothing what will firm do? Plot a price vector p ( p, p ) indicating the 0 0 0 2 monopoly outcome with only firm producing Hint: The price of commodity 2 must be chosen so that demand for firm 2 s output is zero (d) Starting from this price pair, examine the adjustment process proposed by Cournot

Strategy -25- (e) Compare the equilibrium profits with those in the quantity setting game Exercise 2: Dominant strategy equilibrium in a pricing game with two firms producing the same product Firm has a constant marginal cost c and firm 2 a constant marginal cost c 2 Let q f ( p, p 2) be the demand for the goods produced by firm f And let q( p) q( p) q2( p) be the market demand If one sets a lower price then the other it sells to the entire market If the firms sets equal prices consumers are indifferent so any demands q ˆ ˆ ( p, p ) and q ˆ ˆ 2( p, p ) satisfying q ( pˆ, pˆ ) q ( pˆ, pˆ ) q( pˆ, pˆ ) 2 are best responses by consumers (a) Suppose that c c2 c Show that the unique equilibrium pair of prices is ( p, p2) ( c, c) (b) Explain why there is a continuum of equilibrium demands (c) Suppose next that c c2 Show that there is a unique equilibrium pair of prices (d) Is there more than one pair of equilibrium demands?