Auctions: Types and Equilibriums
|
|
- Isaac Blair
- 6 years ago
- Views:
Transcription
1 Auctions: Types and Equilibriums Emrah Cem and Samira Farhin University of Texas at Dallas April 25, 2013 Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
2 Common Auction Forms English Auction: In one variant of the English auction, the sale is conducted by an auctioneer who begins by calling out a low price and raises it, typically in small increments, as long as there are at least two interested bidders. Dutch Auction: In Dutch auction the auctioneer begins by calling out a price high enough so that presumably no bidder is interested in buying the object at that price. This price is gradually lowered until some bidder indicates her interest. The object is then sold to this bidder at the given price. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
3 Common Auction Forms First-price Auction: The sealed-bid first-price auction is another common form where bidders submit bids in sealed envelopes; the person submitting the highest bid wins the object and pays what he bid. Second-price Auction: In sealed-bid second-price auction bidders submit bids in sealed envelopes; the person submitting the highest bid wins the object but pays not what he bid but the second-highest bid. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
4 Equivalent Auctions The Dutch open descending price auction is strategically equivalent to the first-price sealed-bid auction. When values are private, the English open ascending auction is also equivalent to the second-price sealed-bid auction, but in a weaker sense. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
5 Private Value Auctions We will analyze equilibrium bidding behavior in the two common auction forms : First-price Auctions and Second-price Auctions in an environment with independently and identically distributed private values. It is sufficient to consider the two sealed-bid auctions. Each auction format determines a game of incomplete information among the bidders and, keeping the informational environment fixed, we determine a Bayesian-Nash equilibrium for each resulting game. When there are many equilibria, we usually select one on some basis dominance, perfection, or symmetry. We will typically be interested in comparing the outcomes of a symmetric equilibrium an equilibrium in which all bidders follow the same strategy of one auction with a symmetric equilibrium of the other. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
6 The Symmetric Model There is a single object for sale, and N potential buyers are bidding for the object. Bidder i assigns a value of X i to the object the maximum amount a bidder is willing to pay for the object. Each X i is independently and identically distributed on some interval [0, ω] according to the increasing distribution function F. It is assumed that F admits a continuous density f F and has full support. A strategy for a bidder is a function β i : [0, ω] R +, which determines his or her bid for any value. The distribution F is common knowledge, as is the number of bidders. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
7 Assumptions Independence - the values of different bidders are independently distributed. Risk neutrality - all bidders seek to maximize their expected profits. No budget constraints - all bidders have the ability to pay up to their respective values. Symmetry - the values of all bidders are distributed according to same distribution function F. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
8 Second-price Auctions In a second-price auction, each bidder submits a sealed bid of b i, and given these bids, the payoffs are: x i max j i b j if b i > max j i b j Π i = 0 if b i < max j i b j If there is a tie, so b i = max j i b j, the object goes to each winning bidder with equal probability. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
9 Second-price Auctions Proposition 1 In a second-price sealed-bid auction, it is a weakly dominant strategy to bid according to β II (x) = x. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
10 Second-price Auctions It should be noted that the argument in Proposition 1 relied neither on the assumption that bidders values were independently distributed nor the assump- tion that they were identically so. Only the assumption of private values is important, and proposition holds as long as this is the case. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
11 Second-price Auctions Proof: Consider bidder 1, say, and suppose that p 1 = max j 1 b j is the highest competing bid. By bidding x 1, bidder 1 will win if x 1 > p 1 and not if x 1 < p 1 (if x 1 = p 1, bidder 1 is indifferent between winning and losing). Suppose, however, that he bids an amount z 1 < x 1. If x 1 > z 1 p 1, then he still wins, and his profit is still x 1 p 1. If p 1 > x 1 > z 1, he still loses. However, if x 1 > p 1 > z 1, then he loses, whereas if he had bid x 1, he would have made a positive profit. Thus, bidding less than x 1 can never increase his profit but in some circumstances may actually decrease it. A similar argument shows that it is not profitable to bid more than x 1. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
12 Second-price Auctions Let us ask how much each bidder expects to pay (N-1) in equilibrium. Fix a bidder say, 1 and let the random variable Y 1 Y 1 denote the highest value among the N - 1 remaining bidders. In other words, Y 1 is the highest-order statistic of X 2, X 3,..., X N. Let G denote the distribution function of Y 1. Clearly, for all y, G(y) = F (y) N 1. In a second-price auction, the expected payment by a bidder with value x can be written as m II (x) = Prob[Win] E[2nd highest bid x is the highest bid] = Prob[Win] E[2nd highest value x is the highest value] = G(x) E[Y 1 Y 1 < x] Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
13 First-price Auctions In a first-price auction, each bidder submits a sealed bid of b i, and given these bids, the payoffs are: x i b i if b i > max j i b j Π i = 0 if b i < max j i b j If there is more than one bidder with the highest bid, the object goes to each such bidder with equal probability. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
14 First-price Auctions Suppose that bidders j 1 follow the symmetric, increasing, and differentiable equilibrium strategy β I β. Suppose bidder 1 receives a signal, X 1 = x, and bids b. We wish to determine the optimal b. It can never be optimal to choose a bid b > β(ω) We will only consider bids b β(ω). Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
15 First-price Auctions Bidder 1 wins the auction whenever he submits the highest bid that is, whenever max i 1 β(x i ) < b. Since β is increasing, max i 1 β(x i ) = β(max i 1 X i ) = β(y 1 ) where, as before, Y 1 Y (N 1) 1, the highest of N - 1 values. Bidder 1 wins whenever β(y 1 ) < b or equivalently, whenever Y 1 < β 1 (b). His expected payoff is therefore G(β 1 (b))x(x b) where, again, G is the distribution of Y 1. Maximizing this with respect to b yields the first-order condition: g(β 1 (b)) β (β 1 (b)) (x b) G(β 1 (b)) = 0 Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
16 First-price Auctions At a symmetric equilibrium, b = β(x), and putting the value in the differential equation yields, G(x)β (x) + g(x)β(x) = xg(x) or equivalently, d (G(x)β(x)) = xg(x) dx and since β(0) = 0, we have β(x) = 1 yg(y)dy G(x) 0 = E[Y 1 Y 1 < x] Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
17 First-price Auctions Proposition 2 Symmetric equilibrium strategies in a first-price auction are given by β I (x) = E[Y 1 Y 1 < x] where Y 1 is the highest of N - 1 independently drawn values. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
18 First-price Auctions Proof: Suppose that all but bidder 1 follow the strategy β I β. We will argue that in that case it is optimal for bidder 1 to follow β also. First, notice that β is an increasing and continuous function. Thus, in equilibrium the bidder with the highest value submits the highest bid and wins the auction. It is not optimal for bidder 1 to bid a b > β(ω). The expected payoff of bidder 1 with value x if he bids an amount b β(ω) is calculated as follows. Denote by z = β 1 (b) the value for which b is the equilibrium bid that is, β(z) = b. Then we can write bidder 1s expected payoff from bidding β(z) when his value is x as follows: Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
19 First-price Auctions Π(b, x) = G(z)[x β(z)] = G(z)x G(z)E[Y 1 Y 1 < x] = G(z)x z 0 yg(y)dy = G(z)x G(z)z + z = G(z)(x z) + 0 z 0 G(y)dy G(y)dy Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
20 First-price Auctions We thus obtain that Π(β(x), x) Π(β(z), x) = G(z)(x z) + G(y)dy 0 z x regardless of whether z x or z x. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
21 Revenue Comparison Proposition 3 With independently and identically distributed private values, the expected revenue in a first-price auction is the same as the expected revenue in a second-price auction. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
22 Revenue Comparison When values are uniformly distributed and there are only two bidders, the equilibrium strategy in a first-price auction is β I (x) = 1 2 x. If the realized values are such that 1 2 x 1 > x 2, then the revenue in a first-price auction is greater than that in a second-price auction. If 1 2 x 1 < x 2 < x 1, the opposite is true. Depending on the realized values, we have argued that on average the revenue to the seller will be the same. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
23 Revenue Comparison Let L I denote the distribution of the equilibrium price in a first-price auction let L II be the distribution of prices in a second-price auction. L II is a mean-preserving spread of L I Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
24 Revenue Comparison The figure depicts the two distributions in the case of uniformly distributed values with two bidders. Since the two distributions have the same mean, the two shaded regions are, as they must be, equal in area. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
25 Revenue Comparison Proposition 4 With independently and identically distributed private values, the distribution of equilibrium prices in a second-price auction is a mean-preserving spread of the distribution of equilibrium prices in a first-price auction. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
26 Standard Auction An auction is standard if the rules of the auction dictate that the person who bids the highest amount is awarded the object. Both first and second-price auctions are standard auctions. Given a standard auction form, A, and a symmetric equilibrium β A of the auction, let m A (x) be the equilibrium expected payment by a bidder with value x. The expected payment of a bidder with value 0 is 0. The expected payment function m A (.) does not depend on the particular auction form A. The expected revenue in any standard auction is the same, a fact known as the revenue equivalence principle. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
27 Standard Auction Proposition 5 Suppose that values are independently and identically distributed and all bidders are risk neutral. Then any symmetric and increasing equilibrium of any standard auction, such that the expected payment of a bidder with value zero is zero, yields the same expected revenue to the seller. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
28 Qualifications and Extensions The revenue equivalece principle is based on four assumptions discussed before. The revenue equivalence principle is affected when some of these assumptions are relaxed. With symmetric, independent private values, the expected revenue in a first-price auction is greater than that in a second-price auction for risk averse bidders with same utility function. Suppose bidders are subject to financial constraints. If the first-price auction has a symmetric equilibrium of the form B I (x, w) = min(β(x), w), then the expected revenue in a first-price auction is greater than the expected revenue in a second-price auction. With asymmetric bidders, the expected revenue in a second-price auction may exceed that in a first-price auction. Emrah Cem and Samira Farhin (UTD) Auctions April 25, / 28
Auction theory. Filip An. U.U.D.M. Project Report 2018:35. Department of Mathematics Uppsala University
U.U.D.M. Project Report 28:35 Auction theory Filip An Examensarbete i matematik, 5 hp Handledare: Erik Ekström Examinator: Veronica Crispin Quinonez Augusti 28 Department of Mathematics Uppsala University
More information1 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 informationAuctions 1: Common auctions & Revenue equivalence & Optimal mechanisms. 1 Notable features of auctions. use. A lot of varieties.
1 Notable features of auctions Ancient market mechanisms. use. A lot of varieties. Widespread in Auctions 1: Common auctions & Revenue equivalence & Optimal mechanisms Simple and transparent games (mechanisms).
More informationCS 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 informationNotes 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 informationLecture 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 informationAuction 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 informationProblem 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 informationMarch 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 informationAuctions. 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 informationECON 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 informationAuctions. 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 informationBayesian 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 informationGames 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 informationGame 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 informationStrategy -1- Strategic equilibrium in auctions
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
More informationRevenue Equivalence and Income Taxation
Journal of Economics and Finance Volume 24 Number 1 Spring 2000 Pages 56-63 Revenue Equivalence and Income Taxation Veronika Grimm and Ulrich Schmidt* Abstract This paper considers the classical independent
More informationRecap 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 informationStrategy -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 informationOn 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 informationOptimal 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 informationAuctions 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 informationIndependent 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 informationChapter 3. Dynamic discrete games and auctions: an introduction
Chapter 3. Dynamic discrete games and auctions: an introduction Joan Llull Structural Micro. IDEA PhD Program I. Dynamic Discrete Games with Imperfect Information A. Motivating example: firm entry and
More informationECON 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 informationBayesian 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 informationCUR 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 informationAuction. Li Zhao, SJTU. Spring, Li Zhao Auction 1 / 35
Auction Li Zhao, SJTU Spring, 2017 Li Zhao Auction 1 / 35 Outline 1 A Simple Introduction to Auction Theory 2 Estimating English Auction 3 Estimating FPA Li Zhao Auction 2 / 35 Background Auctions have
More informationAuctions. 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 informationToday. 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 informationOctober 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 informationHW 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 informationRecalling that private values are a special case of the Milgrom-Weber setup, we ve now found that
Econ 85 Advanced Micro Theory I Dan Quint Fall 27 Lecture 12 Oct 16 27 Last week, we relaxed both private values and independence of types, using the Milgrom- Weber setting of affiliated signals. We found
More informationProblem 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 informationKIER 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 informationMicroeconomic 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 informationby 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 informationAll 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 informationECO 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 informationDay 3. Myerson: What s Optimal
Day 3. Myerson: What s Optimal 1 Recap Last time, we... Set up the Myerson auction environment: n risk-neutral bidders independent types t i F i with support [, b i ] and density f i residual valuation
More informationSubjects: 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 informationSignaling in an English Auction: Ex ante versus Interim Analysis
Signaling in an English Auction: Ex ante versus Interim Analysis Peyman Khezr School of Economics University of Sydney and Abhijit Sengupta School of Economics University of Sydney Abstract This paper
More informationMicroeconomics 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 informationAuction Theory. Philip Selin. U.U.D.M. Project Report 2016:27. Department of Mathematics Uppsala University
U.U.D.M. Project Report 2016:27 Auction Theory Philip Selin Examensarbete i matematik, 15 hp Handledare: Erik Ekström Examinator: Veronica Crispin Quinonez Juni 2016 Department of Mathematics Uppsala Uniersity
More informationMicroeconomic Theory III Spring 2009
MIT OpenCourseWare http://ocw.mit.edu 14.123 Microeconomic Theory III Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. MIT 14.123 (2009) by
More information1 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 informationAuction 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 informationMicroeconomic 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 informationCUR 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 informationGame Theory Problem Set 4 Solutions
Game Theory Problem Set 4 Solutions 1. Assuming that in the case of a tie, the object goes to person 1, the best response correspondences for a two person first price auction are: { }, < v1 undefined,
More informationECO 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(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 informationSequential-move games with Nature s moves.
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 Strategies in
More informationISSN BWPEF Uninformative Equilibrium in Uniform Price Auctions. Arup Daripa Birkbeck, University of London.
ISSN 1745-8587 Birkbeck Working Papers in Economics & Finance School of Economics, Mathematics and Statistics BWPEF 0701 Uninformative Equilibrium in Uniform Price Auctions Arup Daripa Birkbeck, University
More informationExperiments 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 informationEconS 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 informationwithout transaction costs, all government allocations are equally efficient, since parties will bargain to correct any externality.
0 Auctions The Coase theorem without transaction costs, all government allocations are equally efficient, since parties will bargain to correct any externality. with transaction costs, government may minimize
More informationUp till now, we ve mostly been analyzing auctions under the following assumptions:
Econ 805 Advanced Micro Theory I Dan Quint Fall 2007 Lecture 7 Sept 27 2007 Tuesday: Amit Gandhi on empirical auction stuff p till now, we ve mostly been analyzing auctions under the following assumptions:
More information6.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 informationThe 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 informationGame 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 informationEconomics 101A (Lecture 21) Stefano DellaVigna
Economics 101A (Lecture 21) Stefano DellaVigna November 11, 2009 Outline 1. Oligopoly: Cournot 2. Oligopoly: Bertrand 3. Second-price Auction 4. Auctions: ebay Evidence 1 Oligopoly: Cournot Nicholson,
More informationEC476 Contracts and Organizations, Part III: Lecture 3
EC476 Contracts and Organizations, Part III: Lecture 3 Leonardo Felli 32L.G.06 26 January 2015 Failure of the Coase Theorem Recall that the Coase Theorem implies that two parties, when faced with a potential
More informationOctober 9. The problem of ties (i.e., = ) will not matter here because it will occur with probability
October 9 Example 30 (1.1, p.331: A bargaining breakdown) There are two people, J and K. J has an asset that he would like to sell to K. J s reservation value is 2 (i.e., he profits only if he sells it
More informationGames of Incomplete Information
Games of Incomplete Information EC202 Lectures V & VI Francesco Nava London School of Economics January 2011 Nava (LSE) EC202 Lectures V & VI Jan 2011 1 / 22 Summary Games of Incomplete Information: Definitions:
More informationUniversity 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 informationNotes 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 informationEconomics 101A (Lecture 21) Stefano DellaVigna
Economics 101A (Lecture 21) Stefano DellaVigna April 14, 2015 Outline 1. Oligopoly: Cournot 2. Oligopoly: Bertrand 3. Second-price Auction 4. Auctions: ebay Evidence 1 Oligopoly: Cournot Nicholson, Ch.
More informationEcon 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 informationAuctions. 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 informationFrancesco 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 informationRevenue 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 informationMicroeconomics 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 informationAuctions and Common Property
Sloan School of Management 15.010/15.011 Massachusetts Institute of Technology RECITATION NOTES #9 Auctions and Common Property Friday - November 19, 2004 OUTLINE OF TODAY S RECITATION 1. Auctions: types
More informationSocial 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 informationAuctions. 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 informationAnswer 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 informationMechanism 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 informationCommitment in First-price Auctions
Commitment in First-price Auctions Yunjian Xu and Katrina Ligett November 12, 2014 Abstract We study a variation of the single-item sealed-bid first-price auction wherein one bidder (the leader) publicly
More informationIn 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 informationBIDDING STRATEGIES IN PROCUREMENT-RELATED TWO-STAGE AUCTIONS. Yaroslav Kheilyk. Kyiv School of Economics
BIDDING STRATEGIES IN PROCUREMENT-RELATED TWO-STAGE AUCTIONS by Yaroslav Kheilyk A thesis submitted in partial fulfillment of the requirements for the degree of MA in Economic Analysis. Kyiv School of
More informationMicroeconomics 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 informationPractice 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 informationSimon 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 informationAuctions in the wild: Bidding with securities. Abhay Aneja & Laura Boudreau PHDBA 279B 1/30/14
Auctions in the wild: Bidding with securities Abhay Aneja & Laura Boudreau PHDBA 279B 1/30/14 Structure of presentation Brief introduction to auction theory First- and second-price auctions Revenue Equivalence
More informationMA300.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 informationShills and Snipes. June Abstract
Shills and Snipes Subir Bose University of Leicester sb345@leicester.ac.uk Arup Daripa Birkbeck College University of London a.daripa@bbk.ac.uk June 2011 Abstract Many online auctions with a fixed end-time
More informationLast-Call Auctions with Asymmetric Bidders
Last-Call Auctions with Asymmetric Bidders Marie-Christin Haufe a, Matej Belica a a Karlsruhe nstitute of Technology (KT), Germany Abstract Favoring a bidder through a Right of First Refusal (ROFR) in
More informationOptimal 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 informationCorporate Control. Itay Goldstein. Wharton School, University of Pennsylvania
Corporate Control Itay Goldstein Wharton School, University of Pennsylvania 1 Managerial Discipline and Takeovers Managers often don t maximize the value of the firm; either because they are not capable
More informationS 2,2-1, x c C x r, 1 0,0
Problem Set 5 1. There are two players facing each other in the following random prisoners dilemma: S C S, -1, x c C x r, 1 0,0 With probability p, x c = y, and with probability 1 p, x c = 0. With probability
More informationMultiunit 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 informationEconomics 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 informationECON106P: 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 informationAuctions and Optimal Bidding
Auctions and Optimal Bidding Professor B. Espen Dartmouth and NHH 2010 Agenda Examples of auctions Bidding in private value auctions Bidding with termination fees and toeholds Bidding in common value auctions
More informationGames 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 informationBlind Portfolio Auctions via Intermediaries
Blind Portfolio Auctions via Intermediaries Michael Padilla Stanford University (joint work with Benjamin Van Roy) April 12, 2011 Computer Forum 2011 Michael Padilla (Stanford University) Blind Portfolio
More informationUCLA 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 informationAuctioning a Single Item. Auctions. Simple Auctions. Simple Auctions. Models of Private Information. Models of Private Information
Auctioning a Single Item Auctions Auctions and Competitive Bidding McAfee and McMillan (Journal of Economic Literature, 987) Milgrom and Weber (Econometrica, 982) 450% of the world GNP is traded each year
More informationConsider 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