Strategy -1- Strategic equilibrium in auctions

Size: px
Start display at page:

Download "Strategy -1- Strategic equilibrium in auctions"

Transcription

1 Strategy -- Strategic equilibrium in auctions A. Sealed high-bid auction 2 B. Sealed high-bid auction: a general approach 6 C. Other auctions: revenue equivalence theorem 27 D. Reserve price in the sealed high-bid auction 33 E. Dutch auction 35 F. Additional exercises 36 UCLA Auction House 38 pages

2 Strategy -2- A. Sealed high bid auction model Private information: Each buyer s value is private information. **

3 Strategy -3- Sealed high bid auction model Private information: Each buyer s value is private information. Common knowledge: It is common knowledge that buyer i s value, draw from a continuous distribution. We define F( v ) Pr{ v v }. i i i This is called the cumulative distribution function (c.d.f.). * v i, is an independent random

4 Strategy -4- Sealed high bid auction 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( v ) Pr{ v v }. i i i This is called the cumulative distribution function (c.d.f.). The values: The values lie on an interval [0, ].

5 Strategy -5- Strategies With private information a player s action depends upon his private information. In the sealed highbid auction, a player s private information is the value v i that he places on the item for sale. His bid is then some mapping b B ( v ) from every possible value i i i This mapping is the player s bidding strategy. Buyers with higher values have more to lose by not winning. So it is natural to assume that buyers with higher values will bid more so that Bv ( ) is a strictly increasing function. i i v i into a non-negative bid.

6 Strategy -6- Equilibrium strategies Since we assume that each buyer s value is a draw from the same distribution it is natural to assume that the equilibrium is symmetric. B ( v ) B( v ) i i i In a symmetric equilibrium, what is buyer s win probability if he has value ˆv? **

7 Strategy -7- Equilibrium strategies Since we assume that each buyer s value is a draw from the same distribution it is natural to assume that the equilibrium is symmetric. B ( v ) B( v ) i i i In a symmetric equilibrium, what is buyer s win probability if he has value ˆv? Key observation: Two buyers. Buyer wins if buyer 2 s bid is lower. Buyer 2 bids lower if and only if his value is lower. So buyer s equilibrium win probability is w( v ) Pr{ B( v2) B( v} Pr{ v2 v} F( v) *

8 Strategy -8- Equilibrium strategies Since we assume that each buyer s value is a draw from the same distribution it is natural to assume that the equilibrium is symmetric. B ( v ) B( v ) i i i Key observation: Two buyers. Buyer wins if buyer 2 s bid is lower. Buyer 2 bids lower only if his value is lower. So buyer s equilibrium win probability is w( v ) Pr{ B( v2) B( v} Pr{ v2 v} F( v) Three buyers. Buyer wins if and only if the other two buyers bids are both lower. This is true only if their values are both lower. So buyer s equilibrium win probability is w( v ) Pr{ v v } Pr{ v v } F( v ) 2 3 2

9 Strategy -9- Equilibrium Strategies Bayesian Nash Equilibrium (BNE) strategies: With private information, strategies that are mutual best response strategies are called Bayesian Nash Equilibrium strategies. Remark: With uncertainty about values, a strategy is a description of an action conditional upon a participants value. So conditional probabilities play a role. Symmetric BNE of the sealed high bid auction If all other buyers other then buyer i use the bidding strategy b B( v ) then buyer i s best j j response is to use the same strategy, i.e. b B( v ). i.e. equilibrium strategies are best responses. i i

10 Strategy -0- An example: Two buyers with values uniformly distributed on [0,00]. For the uniform distribution values are equally likely. Therefore 25 Pr{ vi 25}, Pr{ vi 50}, Pr{ vi 80}.. 00 vi Thus the c.d.f. is F( vi ) Pr( vi vi ) 00 For any guess as to the equilibrium strategy, We can check to see if the guess is correct. *

11 Strategy -- An example: Two buyers with values uniformly distributed on [0,00]. For the uniform distribution values are equally likely. Therefore 25 Pr{ vi 25}, Pr{ vi 50}, Pr{ vi 80}.. 00 vi Thus the c.d.f. is F( vi ) Pr( vi vi ) 00 For any guess as to the equilibrium strategy, We can check to see if the guess is correct. There are two buyers. Suppose that buyer 2 bids according to the strategy B( v ) v We need to show that buyer s best response is to bid b v. 2 Proposed equilibrium strategy Then these strategies are mutual best responses.

12 Strategy -2- Solving for buyer s best response when his value is v If buyer bids b ˆ 20 he has the high bid if B( v ) v bˆ 20, i.e. if v Buyer s win probability is therefore 40 wˆ ˆ. Pr{ v2 40} 00 Buyer s expected payoff is therefore 40 U( v ˆ ˆ, b) ( v b) w( b) ( v 20) 00

13 Strategy -3- If buyer bids b he has the high bid if B( v ) v b, i.e. v 2 2 b. Buyer s win probability is therefore 2b w( b) Pr{ v2 2 b} F(2 b). 00 Buyer s expected payoff is therefore 2b 2 U v b v b w b v b vb b (, ) ( ) ( ) ( ) ( ) b U 2 v b v b (, ) ( 2 ) 00 0 for a maximum. If buyer 2 uses the strategy b v we have therefore shown that buyer s expected gain is maximized if b v Thus the strategies are mutual best responses.

14 Strategy -4- Group Exercise: Three buyers with values uniformly distributed (a) Show that if buyer 2 and buyer 3 bid according to b j 2 v j, then buyer s best response is to bid b v 2 when his value is v (b) Show that for some 2, bj B( vj) vj is the equilibrium bidding strategy (c) What is the equilibrium bidding strategy with 4 buyers?

15 Strategy -5- Answer to (b) The probability that buyer wins with a bid of b is the joint probability that w ( b) Pr{ b b} Pr{ b b} 2 3 Pr{ v b} Pr{ v b} 2 3 b b b b Pr{ v2 } Pr{ v3 } F ( ) ( ) 2 2 b U( v, b) ( v b) w( b) ( v b)( ) ( vb 2 b ) b2 b and b3 b, ie. U b (2 2 vb 3 ) 0 2 b for a maximum. 2 Therefore buyer s best response is B ( v ) v. Note that this is true if Thus if the other buyers bid Bj( j) 3 j response is to do so as well. The problem with this approach is that it requires an inspired guess., then buyer s best

16 Strategy -6- B. Sealed high bid auctions: A general approach - - Characterize equilibrium payoffs U( v) w( v)( v B( v)) equilibrium equilibrium net gain payoff win probability if buyer wins Rewrite as follows U( v) w( v) v w( v) B( v) equilibrium expected expected payoff gross gain buyer payment *

17 Strategy -7- B. Sealed high bid auctions: A general approach - - Characterize equilibrium payoffs U( v) w( v)( v B( v)) equilibrium equilibrium net gain payoff win probability if buyer wins Rewrite as follows U( v) w( v) v w( v) B( v) (*) equilibrium expected expected payoff gross gain buyer payment We solve (i) for the equilibrium win probability and hence the expected gross gain, (ii) for the equilibrium payoff. We can then solve for the equilibrium bid function by appealing to (*).

18 Strategy -8- Remark: We can write the buyer s equilibrium payoff as U( v) w( v) v w( v) B( v) equilibrium expected expected payoff gross gain buyer payment Since the payment by the buyer is the revenue that the seller receives from the buyer, U( v) w( v) v R( v) equilibrium expected expected payoff gross gain seller revenue (This will be useful when we consider other auctions.)

19 Strategy -9- Solution: Step : Obtain an expression for buyer s equilibrium win probability Class Exercise: Two buyers: Why is the equilibrium probability w( v) F( v)? Three buyers: Why is the equilibrium probability w( v ) ( ) 2 F v?

20 Strategy -20- Equilibrium win probability with I buyers If buyer with a value of v makes an equilibrium bid of Bv ( ), then she has the high bid if b B( v ) B( v ), for j 2,..., I j j equivalently, vj v, for j 2,..., I The joint probability of this event is w( v ) Pr{ v v } Pr{ v v }... Pr{ v v } F( v ) I 2 3 I

21 Strategy -2- Step 2: Suppose that buyer is naïve (stupid!) Suppose buyer uses the strategy BN( v ) B( vˆ ) b ˆ regardless of her value Since Bv ( ) is her best response strategy, The naïve strategy is a best response If and only if v vˆ. (Note that, regardless of her value, buyer bids ˆb. Then her win probability is wv ( ˆ ).)

22 Strategy -22- Let Uv ( ) be her equilibrium payoff. Let UN ( v) be her payoff if she is naive. Then U ( vˆ) U ( vˆ) N and U( v ) UN( v ) for all v vˆ Key conclusion: The graphs of the two functions must be tangential* at v vˆ U ( vˆ) U ( vˆ) N * As we shall next show, the graph of UN ( v ) is actually a line.

23 Strategy -23- The naïve buyer always bids ˆb so her win probability is always Therefore wv ( ˆ ) UN( v ) w( vˆ )( v bˆ) w( vˆ ) v w( vˆ ) bˆ. *

24 Strategy -24- But the naïve buyer always bids ˆb so her win probability is always Therefore wv ( ˆ ) UN( v ) w( vˆ )( v bˆ) w( vˆ ) v w( vˆ ) bˆ This is a line of slope wv ( ˆ ). Therefore U ( vˆ ) U ( vˆ ) w( vˆ ). N w( vˆ) v R( vˆ). Since we can make the same argument for any ˆv, we have proved the following result. Proposition: Marginal equilibrium payoff The rate at which the equilibrium payoff rises with the buyer s value is equal to the equilibrium win probability U ( v) w( v)

25 Strategy -25- The lowest value participant has an equilibrium payoff of zero since other buyers have higher values with probability. Thus they make higher bids with probability. We can then integrate U () v to obtain the equilibrium payoff Uv (). v i U( v ) w( v) dv where i 0 w( v) F( v) I Also U( v ) w( v )( v B( v )) i i i i equilibrium equilibrium net gain payoff win probability if buyer wins Then we can solve for the equilibrium bid function.

26 Strategy -26- Example: Uniform distribution with 3 buyers Proposition: U ( v) w( v) F( v) where U( v) w( v)( v B( v)) Suppose that buyers values are uniformly distributed on [0,] (in millions of dollars) so F() v 2 2. U ( v) F( v) v Then 3 U() v 3 v k But the lowest type wins with zero probability so U(0) 0. Therefore U() v Also 3 v 3 2 U( v) w( v)( v B( v)) v ( v B( v)). v Therefore 2 3 v ( v B( v)) 3 v and so v B() v 3 v. 2 Therefore B() v 3 v.

27 Strategy -27- C. Other sealed bid auctions: We will now generalize the above argument. In the sealed high bid auction U( v) w( v)( v B( v)) equilibrium equilibrium net gain payoff win probability if buyer wins This can be rewritten as follows U( v) w( v) v w( v) B( v) equilibrium expected expected payoff gross gain buyer payment Since the payment by the buyer is the revenue of the seller we can also write U( v) w( v) v R( v) equilibrium expected expected payoff gross gain seller revenue

28 Strategy -28- Consider some other auction in which the equilibrium bidding strategies are strictly increasing Example : Sealed second-bid auction Example 2: All pay auction Buyers submit non-refundable bids. The high bidder is the winner. Then the equilibrium win probability is w( v ) F( v ) I i i, just as in the sealed high-bid auction. Let Rv ( i ) be the equilibrium expected payment by buyer i. Then buyer i s equilibrium payoff is U( v ) w( v ) v R( v ) i i i i equilibrium expected expected payoff gross gain seller revenue We can argue step 2 in the same way.

29 Strategy -29- Equilibrium payoff: U( v ) w( v ) v R( v ) i i i i Step 2: Suppose that buyer is naïve (stupid!) B N( v ) ( ˆ ) Suppose buyer uses the strategy B v regardless of her value. Then her expected payment is Rv ( ˆ ), regardless of her value U v w vˆ v R vˆ N( ) ( ) ( ) Since Bv ( ) is her best response strategy, the naïve strategy is a best response If and only if v vˆ. U v w vˆ v R vˆ N( ) ( ) ( ) Is a line with slope wv ( ˆ ). Therefore U ( vˆ ) U N ( vˆ ) w( vˆ ).

30 Strategy -30- Since we can make the same argument for any ˆv, we have proved the following result. Proposition: The incremental equilibrium payoff for a buyer with a higher value is equal to the equilibrium win probability U ( ) w( ) **

31 Strategy -3- Since we can make the same argument for any ˆv, we have proved the following result. Proposition: The incremental equilibrium payoff for a buyer with a higher value is equal to the equilibrium win probability U ( ) w( ) A buyer with the lowest value has a zero probability of winning so U(0) 0. Therefore Proposition: Buyer equivalence Theorem The equilibrium payoff for a buyer with value v i is v i U( v ) w( v) dv i 0 *

32 Strategy -32- Since we can make the same argument for any ˆv, we have proved the following result. Proposition: The incremental equilibrium payoff for a buyer with a higher value is equal to the equilibrium win probability U ( ) w( ) A buyer with the lowest value has a zero probability of winning so U(0) 0. Therefore Proposition: Buyer equivalence Theorem The equilibrium payoff for a buyer with value v i is v i U( v ) w( v) dv i 0 Since U( v ) w( v ) v R( v ) i i i i Proposition: Payment equivalence Theorem The equilibrium expected payment by a buyer, Rv ( i ) is the same as in the sealed high-bid auction. Revenue equivalence: Since the expected payment is the expected revenue of the seller, the expected seller revenue is the same.

33 Strategy -33- D. Reserve price in the sealed high-bid auction Proposition: U ( v) w( v) where U( v) w( v)( v B( v)) Analysis: The seller sets a reserve price (i.e. minimum bid of than v is Fv (). What is the equilibrium payoff? v 0). The probability that a buyer s value is less A buyer has a value vi v0 has a strictly positive payoff if he enters the auction and make a bid satisfying v0 B( v ) v. * i i

34 Strategy -34- D. Reserve price in the sealed high-bid auction Proposition: U ( v) w( v) where U( v) w( v)( v B( v)) Analysis: The seller sets a reserve price (i.e. minimum bid of than v is Fv (). What is the equilibrium payoff? v 0). The probability that a buyer s value is less A buyer with a value vi v0 enters the auction and make a bid satisfying v0 B( v ) v. i i This is depicted opposite. It follows that v0 B( v0) 0. Hence U( v0 ) w( v0 )( v0 B( v0 )) 0 Therefore U( v ) U( v ) U( v ) U ( v) dv w( v) dv i i 0 v i i v0 v0 v

35 Strategy -35- E. Open descending price auction (descending clock auction) Clock starts ticking down. When a buyer raises his hand the clock stops and the buyer pays the price on the clock. Proposition: The equilibrium bidding strategy is to stop the clock when the asking price is the equilibrium bid in the sealed high-bid auction

36 Strategy -36- E. Exercises The first two exercises consider the following model discussed on page 8. If the total output is q q2... qn then the market clearing price is p( q... q n ). Suppose n n i i, Ci ( qi ) 2q i i i p( q ) 60 q, i=,,n Exercise : Nash equilibrium with more than two firms What is the equilibrium price if there are (i) three identical firms (ii) 5 identical firms Exercise 2: Nash equilibrium with a large number of firms Show that the equilibrium price approaches 2 as the number of firms grows large.

37 Strategy -37- Exercise 3: Equilibrium with increasing marginal cost Suppose p( q) 60 ( q q2), C ( q ) 50 q and 2 C ( q ) 50 q (a) Solve for the Nash Equilibrium outputs and price. (b) What would the firms do if they could collude and so maximize the total profit of the two firms? (c) Might the answer change if C ( q ) 00 q

38 Strategy -38- Exercise 5: 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 p 0 p, q p 20 p2. 2 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 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. (e) Compare the equilibrium profits with those in the quantity setting game.

39 Strategy Sealed high-bid auction with a reserve price (minimum price). Each of two buyers has a value that is uniformly distributed on [0,]. The seller sets a reserve price of. (a) Explain why U () v v for all v. (b) Explain why Uv ( ) 0 for all v. (c) Hence solve for Uv (). (d) Use this result to solve for the equilibrium bid function.

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

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

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

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

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

x. The saver is John Riley 7 December 2016 Econ 401a Final Examination Sketch of answers 1. Choice over time Then Adding, John Riley 7 December 06 Econ 40a Final Eamination Sketch of answers Choice over time (a) y s, Adding, y ( r) s y s r r y y r r (b) The slope of the life-time budget line is r When r The initial optimum

More information

ECO 426 (Market Design) - Lecture 8

ECO 426 (Market Design) - Lecture 8 ECO 426 (Market Design) - Lecture 8 Ettore Damiano November 23, 2015 Revenue equivalence Model: N bidders Bidder i has valuation v i Each v i is drawn independently from the same distribution F (e.g. U[0,

More information

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

by open ascending bid (English) auction Auctioneer raises asking price until all but one bidder drops out Auctions. Auction off a single item (a) () (c) (d) y open ascending id ("English") auction Auctioneer raises asking price until all ut one idder drops out y Dutch auction (descending asking price) Auctioneer

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

1 Theory of Auctions. 1.1 Independent Private Value Auctions

1 Theory of Auctions. 1.1 Independent Private Value Auctions 1 Theory of Auctions 1.1 Independent Private Value Auctions for the moment consider an environment in which there is a single seller who wants to sell one indivisible unit of output to one of n buyers

More information

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

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 The Revenue Equivalence Theorem Note: This is a only a draft

More information

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

March 30, Why do economists (and increasingly, engineers and computer scientists) study auctions? March 3, 215 Steven A. Matthews, A Technical Primer on Auction Theory I: Independent Private Values, Northwestern University CMSEMS Discussion Paper No. 196, May, 1995. This paper is posted on the course

More information

Recap First-Price Revenue Equivalence Optimal Auctions. Auction Theory II. Lecture 19. Auction Theory II Lecture 19, Slide 1

Recap First-Price Revenue Equivalence Optimal Auctions. Auction Theory II. Lecture 19. Auction Theory II Lecture 19, Slide 1 Auction Theory II Lecture 19 Auction Theory II Lecture 19, Slide 1 Lecture Overview 1 Recap 2 First-Price Auctions 3 Revenue Equivalence 4 Optimal Auctions Auction Theory II Lecture 19, Slide 2 Motivation

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

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

Optimal Auctions. Game Theory Course: Jackson, Leyton-Brown & Shoham Game Theory Course: Jackson, Leyton-Brown & Shoham So far we have considered efficient auctions What about maximizing the seller s revenue? she may be willing to risk failing to sell the good she may be

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

Bayesian games and their use in auctions. Vincent Conitzer

Bayesian games and their use in auctions. Vincent Conitzer Bayesian games and their use in auctions Vincent Conitzer conitzer@cs.duke.edu What is mechanism design? In mechanism design, we get to design the game (or mechanism) e.g. the rules of the auction, marketplace,

More information

Problem Set 3: Suggested Solutions

Problem Set 3: Suggested Solutions Microeconomics: Pricing 3E Fall 5. 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 be

More information

Mechanism Design and Auctions

Mechanism Design and Auctions Multiagent Systems (BE4M36MAS) Mechanism Design and Auctions Branislav Bošanský and Michal Pěchouček Artificial Intelligence Center, Department of Computer Science, Faculty of Electrical Engineering, Czech

More information

Auctions: Types and Equilibriums

Auctions: Types and Equilibriums Auctions: Types and Equilibriums Emrah Cem and Samira Farhin University of Texas at Dallas emrah.cem@utdallas.edu samira.farhin@utdallas.edu April 25, 2013 Emrah Cem and Samira Farhin (UTD) Auctions April

More information

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

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017 ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2017 These notes have been used and commented on before. If you can still spot any errors or have any suggestions for improvement, please

More information

We examine the impact of risk aversion on bidding behavior in first-price auctions.

We examine the impact of risk aversion on bidding behavior in first-price auctions. Risk Aversion We examine the impact of risk aversion on bidding behavior in first-price auctions. Assume there is no entry fee or reserve. Note: Risk aversion does not affect bidding in SPA because there,

More information

Revenue Equivalence Theorem (RET)

Revenue Equivalence Theorem (RET) Revenue Equivalence Theorem (RET) Definition Consider an auction mechanism in which, for n risk-neutral bidders, each has a privately know value drawn independently from a common, strictly increasing distribution.

More information

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University Auctions Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University AE4M36MAS Autumn 2015 - Lecture 12 Where are We? Agent architectures (inc. BDI

More information

Games with Private Information 資訊不透明賽局

Games with Private Information 資訊不透明賽局 Games with Private Information 資訊不透明賽局 Joseph Tao-yi Wang 00/0/5 (Lecture 9, Micro Theory I-) Market Entry Game with Private Information (-,4) (-,) BE when p < /: (,, ) (-,4) (-,) BE when p < /: (,, )

More information

Microeconomics Comprehensive Exam

Microeconomics Comprehensive Exam Microeconomics Comprehensive Exam June 2009 Instructions: (1) Please answer each of the four questions on separate pieces of paper. (2) When finished, please arrange your answers alphabetically (in the

More information

Lecture 6 Applications of Static Games of Incomplete Information

Lecture 6 Applications of Static Games of Incomplete Information Lecture 6 Applications of Static Games of Incomplete Information Good to be sold at an auction. Which auction design should be used in order to maximize expected revenue for the seller, if the bidders

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

EconS Games with Incomplete Information II and Auction Theory

EconS Games with Incomplete Information II and Auction Theory EconS 424 - Games with Incomplete Information II and Auction Theory Félix Muñoz-García Washington State University fmunoz@wsu.edu April 28, 2014 Félix Muñoz-García (WSU) EconS 424 - Recitation 9 April

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

Game Theory Lecture #16

Game Theory Lecture #16 Game Theory Lecture #16 Outline: Auctions Mechanism Design Vickrey-Clarke-Groves Mechanism Optimizing Social Welfare Goal: Entice players to select outcome which optimizes social welfare Examples: Traffic

More information

Noncooperative Market Games in Normal Form

Noncooperative Market Games in Normal Form Chapter 6 Noncooperative Market Games in Normal Form 1 Market game: one seller and one buyer 2 players, a buyer and a seller Buyer receives red card Ace=11, King = Queen = Jack = 10, 9,, 2 Number represents

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

Auction Theory: Some Basics

Auction Theory: Some Basics Auction Theory: Some Basics Arunava Sen Indian Statistical Institute, New Delhi ICRIER Conference on Telecom, March 7, 2014 Outline Outline Single Good Problem Outline Single Good Problem First Price Auction

More information

Auctions. Microeconomics II. Auction Formats. Auction Formats. Many economic transactions are conducted through auctions treasury bills.

Auctions. Microeconomics II. Auction Formats. Auction Formats. Many economic transactions are conducted through auctions treasury bills. Auctions Microeconomics II Auctions Levent Koçkesen Koç University Many economic transactions are conducted through auctions treasury bills art work foreign exchange antiques publicly owned companies cars

More information

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

Elements of Economic Analysis II Lecture XI: Oligopoly: Cournot and Bertrand Competition Elements of Economic Analysis II Lecture XI: Oligopoly: Cournot and Bertrand Competition Kai Hao Yang /2/207 In this lecture, we will apply the concepts in game theory to study oligopoly. In short, unlike

More information

ECON20710 Lecture Auction as a Bayesian Game

ECON20710 Lecture Auction as a Bayesian Game ECON7 Lecture Auction as a Bayesian Game Hanzhe Zhang Tuesday, November 3, Introduction Auction theory has been a particularly successful application of game theory ideas to the real world, with its uses

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

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

1 Auctions. 1.1 Notation (Symmetric IPV) Independent private values setting with symmetric riskneutral buyers, no budget constraints.

1 Auctions. 1.1 Notation (Symmetric IPV) Independent private values setting with symmetric riskneutral buyers, no budget constraints. 1 Auctions 1.1 Notation (Symmetric IPV) Ancient market mechanisms. use. A lot of varieties. Widespread in Independent private values setting with symmetric riskneutral buyers, no budget constraints. Simple

More information

The Ohio State University Department of Economics Second Midterm Examination Answers

The Ohio State University Department of Economics Second Midterm Examination Answers Econ 5001 Spring 2018 Prof. James Peck The Ohio State University Department of Economics Second Midterm Examination Answers Note: There were 4 versions of the test: A, B, C, and D, based on player 1 s

More information

Revenue Equivalence and Mechanism Design

Revenue Equivalence and Mechanism Design Equivalence and Design Daniel R. 1 1 Department of Economics University of Maryland, College Park. September 2017 / Econ415 IPV, Total Surplus Background the mechanism designer The fact that there are

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

ECON Microeconomics II IRYNA DUDNYK. Auctions.

ECON Microeconomics II IRYNA DUDNYK. Auctions. Auctions. What is an auction? When and whhy do we need auctions? Auction is a mechanism of allocating a particular object at a certain price. Allocating part concerns who will get the object and the price

More information

Matching Markets and Google s Sponsored Search

Matching Markets and Google s Sponsored Search Matching Markets and Google s Sponsored Search Part III: Dynamics Episode 9 Baochun Li Department of Electrical and Computer Engineering University of Toronto Matching Markets (Required reading: Chapter

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

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

Independent Private Value Auctions

Independent Private Value Auctions John Nachbar April 16, 214 ndependent Private Value Auctions The following notes are based on the treatment in Krishna (29); see also Milgrom (24). focus on only the simplest auction environments. Consider

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

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

Networks: Fall 2010 Homework 3 David Easley and Jon Kleinberg Due in Class September 29, 2010 Networks: Fall 00 Homework David Easley and Jon Kleinberg Due in Class September 9, 00 As noted on the course home page, homework solutions must be submitted by upload to the CMS site, at https://cms.csuglab.cornell.edu/.

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

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

October An Equilibrium of the First Price Sealed Bid Auction for an Arbitrary Distribution. October 13..18.4 An Equilibrium of the First Price Sealed Bid Auction for an Arbitrary Distribution. We now assume that the reservation values of the bidders are independently and identically distributed

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

1 Intro to game theory

1 Intro to game theory These notes essentially correspond to chapter 14 of the text. There is a little more detail in some places. 1 Intro to game theory Although it is called game theory, and most of the early work was an attempt

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

Experiments on Auctions

Experiments on Auctions Experiments on Auctions Syngjoo Choi Spring, 2010 Experimental Economics (ECON3020) Auction Spring, 2010 1 / 25 Auctions An auction is a process of buying and selling commodities by taking bids and assigning

More information

Challenge to Hotelling s Principle of Minimum

Challenge to Hotelling s Principle of Minimum Challenge to Hotelling s Principle of Minimum Differentiation Two conclusions 1. There is no equilibrium when sellers are too close i.e., Hotelling is wrong 2. Under a slightly modified version, get maximum

More information

A. Introduction to choice under uncertainty 2. B. Risk aversion 11. C. Favorable gambles 15. D. Measures of risk aversion 20. E.

A. Introduction to choice under uncertainty 2. B. Risk aversion 11. C. Favorable gambles 15. D. Measures of risk aversion 20. E. Microeconomic Theory -1- Uncertainty Choice under uncertainty A Introduction to choice under uncertainty B Risk aversion 11 C Favorable gambles 15 D Measures of risk aversion 0 E Insurance 6 F Small favorable

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

KIER DISCUSSION PAPER SERIES

KIER DISCUSSION PAPER SERIES KIER DISCUSSION PAPER SERIES KYOTO INSTITUTE OF ECONOMIC RESEARCH http://www.kier.kyoto-u.ac.jp/index.html Discussion Paper No. 657 The Buy Price in Auctions with Discrete Type Distributions Yusuke Inami

More information

Social Network Analysis

Social Network Analysis Lecture IV Auctions Kyumars Sheykh Esmaili Where Are Auctions Appropriate? Where sellers do not have a good estimate of the buyers true values for an item, and where buyers do not know each other s values

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

CS 573: Algorithmic Game Theory Lecture date: March 26th, 2008

CS 573: Algorithmic Game Theory Lecture date: March 26th, 2008 CS 573: Algorithmic Game Theory Lecture date: March 26th, 28 Instructor: Chandra Chekuri Scribe: Qi Li Contents Overview: Auctions in the Bayesian setting 1 1 Single item auction 1 1.1 Setting............................................

More information

Auctions. Episode 8. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto

Auctions. Episode 8. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Auctions Episode 8 Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Paying Per Click 3 Paying Per Click Ads in Google s sponsored links are based on a cost-per-click

More information

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University Auctions Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University AE4M36MAS Autumn 2014 - Lecture 12 Where are We? Agent architectures (inc. BDI

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

ECO 426 (Market Design) - Lecture 9

ECO 426 (Market Design) - Lecture 9 ECO 426 (Market Design) - Lecture 9 Ettore Damiano November 30, 2015 Common Value Auction In a private value auction: the valuation of bidder i, v i, is independent of the other bidders value In a common

More information

Optimal selling rules for repeated transactions.

Optimal selling rules for repeated transactions. Optimal selling rules for repeated transactions. Ilan Kremer and Andrzej Skrzypacz March 21, 2002 1 Introduction In many papers considering the sale of many objects in a sequence of auctions the seller

More information

Auctions. Economics Auction Theory. Instructor: Songzi Du. Simon Fraser University. November 17, 2016

Auctions. Economics Auction Theory. Instructor: Songzi Du. Simon Fraser University. November 17, 2016 Auctions Economics 383 - Auction Theory Instructor: Songzi Du Simon Fraser University November 17, 2016 ECON 383 (SFU) Auctions November 17, 2016 1 / 28 Auctions Mechanisms of transaction: bargaining,

More information

Subjects: What is an auction? Auction formats. True values & known values. Relationships between auction formats

Subjects: What is an auction? Auction formats. True values & known values. Relationships between auction formats Auctions Subjects: What is an auction? Auction formats True values & known values Relationships between auction formats Auctions as a game and strategies to win. All-pay auctions What is an auction? An

More information

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

Lecture #6: Auctions: Theory and Applications. Prof. Dr. Sven Seuken Lecture #6: Auctions: Theory and Applications Prof. Dr. Sven Seuken 15.3.2012 Housekeeping Questions? Concerns? BitTorrent homework assignment? Posting on NB: do not copy/paste from PDFs Game Theory Homework:

More information

(v 50) > v 75 for all v 100. (d) A bid of 0 gets a payoff of 0; a bid of 25 gets a payoff of at least 1 4

(v 50) > v 75 for all v 100. (d) A bid of 0 gets a payoff of 0; a bid of 25 gets a payoff of at least 1 4 Econ 85 Fall 29 Problem Set Solutions Professor: Dan Quint. Discrete Auctions with Continuous Types (a) Revenue equivalence does not hold: since types are continuous but bids are discrete, the bidder with

More information

Practice Problems. U(w, e) = p w e 2,

Practice Problems. U(w, e) = p w e 2, Practice Problems Information Economics (Ec 515) George Georgiadis Problem 1. Static Moral Hazard Consider an agency relationship in which the principal contracts with the agent. The monetary result of

More information

CSV 886 Social Economic and Information Networks. Lecture 4: Auctions, Matching Markets. R Ravi

CSV 886 Social Economic and Information Networks. Lecture 4: Auctions, Matching Markets. R Ravi CSV 886 Social Economic and Information Networks Lecture 4: Auctions, Matching Markets R Ravi ravi+iitd@andrew.cmu.edu Schedule 2 Auctions 3 Simple Models of Trade Decentralized Buyers and sellers have

More information

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

Economics Honors Exam 2009 Solutions: Microeconomics, Questions 1-2 Economics Honors Exam 2009 Solutions: Microeconomics, Questions 1-2 Question 1 (Microeconomics, 30 points). A ticket to a newly staged opera is on sale through sealed-bid auction. There are three bidders,

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

Topics in Informational Economics 2 Games with Private Information and Selling Mechanisms

Topics in Informational Economics 2 Games with Private Information and Selling Mechanisms Topics in Informational Economics 2 Games with Private Information and Selling Mechanisms Watson 26-27, pages 312-333 Bruno Salcedo The Pennsylvania State University Econ 402 Summer 2012 Private Information

More information

All Equilibrium Revenues in Buy Price Auctions

All Equilibrium Revenues in Buy Price Auctions All Equilibrium Revenues in Buy Price Auctions Yusuke Inami Graduate School of Economics, Kyoto University This version: January 009 Abstract This note considers second-price, sealed-bid auctions with

More information

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

UCLA Department of Economics Ph.D. Preliminary Exam Industrial Organization Field Exam (Spring 2010) Use SEPARATE booklets to answer each question Wednesday, June 23 2010 Instructions: UCLA Department of Economics Ph.D. Preliminary Exam Industrial Organization Field Exam (Spring 2010) You have 4 hours for the exam. Answer any 5 out 6 questions. All

More information

Auctioning one item. Tuomas Sandholm Computer Science Department Carnegie Mellon University

Auctioning one item. Tuomas Sandholm Computer Science Department Carnegie Mellon University Auctioning one item Tuomas Sandholm Computer Science Department Carnegie Mellon University Auctions Methods for allocating goods, tasks, resources... Participants: auctioneer, bidders Enforced agreement

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

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

Answer Key for M. A. Economics Entrance Examination 2017 (Main version) Answer Key for M. A. Economics Entrance Examination 2017 (Main version) July 4, 2017 1. Person A lexicographically prefers good x to good y, i.e., when comparing two bundles of x and y, she strictly prefers

More information

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

Multiunit Auctions: Package Bidding October 24, Multiunit Auctions: Package Bidding Multiunit Auctions: Package Bidding 1 Examples of Multiunit Auctions Spectrum Licenses Bus Routes in London IBM procurements Treasury Bills Note: Heterogenous vs Homogenous Goods 2 Challenges in Multiunit

More information

The Cascade Auction A Mechanism For Deterring Collusion In Auctions

The Cascade Auction A Mechanism For Deterring Collusion In Auctions The Cascade Auction A Mechanism For Deterring Collusion In Auctions Uriel Feige Weizmann Institute Gil Kalai Hebrew University and Microsoft Research Moshe Tennenholtz Technion and Microsoft Research Abstract

More information

MA300.2 Game Theory 2005, LSE

MA300.2 Game Theory 2005, LSE MA300.2 Game Theory 2005, LSE Answers to Problem Set 2 [1] (a) This is standard (we have even done it in class). The one-shot Cournot outputs can be computed to be A/3, while the payoff to each firm can

More information

Chapter 3: Computing Endogenous Merger Models.

Chapter 3: Computing Endogenous Merger Models. Chapter 3: Computing Endogenous Merger Models. 133 Section 1: Introduction In Chapters 1 and 2, I discussed a dynamic model of endogenous mergers and examined the implications of this model in different

More information

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

Chapter 10: Mixed strategies Nash equilibria, reaction curves and the equality of payoffs theorem Chapter 10: Mixed strategies Nash equilibria reaction curves and the equality of payoffs theorem Nash equilibrium: The concept of Nash equilibrium can be extended in a natural manner to the mixed strategies

More information

Solution Problem Set 2

Solution Problem Set 2 ECON 282, Intro Game Theory, (Fall 2008) Christoph Luelfesmann, SFU Solution Problem Set 2 Due at the beginning of class on Tuesday, Oct. 7. Please let me know if you have problems to understand one of

More information

CMSC 474, Introduction to Game Theory Introduction to Auctions

CMSC 474, Introduction to Game Theory Introduction to Auctions CMSC 474, Introduction to Game Theory Introduction to Auctions Mohammad T. Hajiaghayi University of Maryland Auctions An auction is a way (other than bargaining) to sell a fixed supply of a commodity (an

More information

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

Oligopoly Games and Voting Games. Cournot s Model of Quantity Competition: Oligopoly Games and Voting Games Cournot s Model of Quantity Competition: Supposetherearetwofirms, producing an identical good. (In his 1838 book, Cournot thought of firms filling bottles with mineral

More information

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

Answers to Microeconomics Prelim of August 24, In practice, firms often price their products by marking up a fixed percentage over (average) Answers to Microeconomics Prelim of August 24, 2016 1. In practice, firms often price their products by marking up a fixed percentage over (average) cost. To investigate the consequences of markup pricing,

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

Microeconomics II. CIDE, Spring 2011 List of Problems

Microeconomics II. CIDE, Spring 2011 List of Problems Microeconomics II CIDE, Spring 2011 List of Prolems 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

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

EC 202. Lecture notes 14 Oligopoly I. George Symeonidis

EC 202. Lecture notes 14 Oligopoly I. George Symeonidis EC 202 Lecture notes 14 Oligopoly I George Symeonidis Oligopoly When only a small number of firms compete in the same market, each firm has some market power. Moreover, their interactions cannot be ignored.

More information

Microeconomics Qualifying Exam

Microeconomics Qualifying Exam Summer 2018 Microeconomics Qualifying Exam There are 100 points possible on this exam, 50 points each for Prof. Lozada s questions and Prof. Dugar s questions. Each professor asks you to do two long questions

More information

Problem Set 2 - SOLUTIONS

Problem Set 2 - SOLUTIONS Problem Set - SOLUTONS 1. Consider the following two-player game: L R T 4, 4 1, 1 B, 3, 3 (a) What is the maxmin strategy profile? What is the value of this game? Note, the question could be solved like

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

1 Theory of Auctions. 1.1 Independent Private Value Auctions

1 Theory of Auctions. 1.1 Independent Private Value Auctions - 1 Theory of Auctions 1.1 Independent Private Value Auctions for the moment consider an environment in which there is a single seller who wants to sell one indivisible unit of output to one of n buyers

More information

On Existence of Equilibria. Bayesian Allocation-Mechanisms

On Existence of Equilibria. Bayesian Allocation-Mechanisms On Existence of Equilibria in Bayesian Allocation Mechanisms Northwestern University April 23, 2014 Bayesian Allocation Mechanisms In allocation mechanisms, agents choose messages. The messages determine

More information

Auctions That Implement Efficient Investments

Auctions That Implement Efficient Investments Auctions That Implement Efficient Investments Kentaro Tomoeda October 31, 215 Abstract This article analyzes the implementability of efficient investments for two commonly used mechanisms in single-item

More information