ECO 426 (Market Design) - Lecture 8

Similar documents
ECO 426 (Market Design) - Lecture 9

Strategy -1- Strategic equilibrium in auctions

(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

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

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

Revenue Equivalence Theorem (RET)

Problem Set 3: Suggested Solutions

ECO 426 (Market Design) - Lecture 11

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

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

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

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

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

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

Independent Private Value Auctions

Recalling that private values are a special case of the Milgrom-Weber setup, we ve now found that

Day 3. Myerson: What s Optimal

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

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

1 Theory of Auctions. 1.1 Independent Private Value Auctions

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

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

ECON20710 Lecture Auction as a Bayesian Game

Econ 101A Final exam May 14, 2013.

Bayesian Nash Equilibrium

Econ 101A Final exam May 14, 2013.

Problem Set 3: Suggested Solutions

Auctions: Types and Equilibriums

When we did independent private values and revenue equivalence, one of the auction types we mentioned was an all-pay auction

Auction types. All Pay Auction: Everyone writes down a bid in secret. The person with the highest bid wins. Everyone pays.

Auction Theory: Some Basics

Social Network Analysis

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

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

Strategy -1- Strategy

Lecture 6 Applications of Static Games of Incomplete Information

Revenue Equivalence and Income Taxation

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

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

EconS Games with Incomplete Information II and Auction Theory

Topics in Contract Theory Lecture 6. Separation of Ownership and Control

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

Up till now, we ve mostly been analyzing auctions under the following assumptions:

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

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

CUR 412: Game Theory and its Applications, Lecture 4

Game Theory Lecture #16

CUR 412: Game Theory and its Applications, Lecture 4

Algorithmic Game Theory

Auctions. Book Pages Auction. Auction types. Rules to Auctions

KIER DISCUSSION PAPER SERIES

Auctions 1: Common auctions & Revenue equivalence & Optimal mechanisms. 1 Notable features of auctions. use. A lot of varieties.

Revenue Equivalence and Mechanism Design

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

University of Michigan. July 1994

Auction is a commonly used way of allocating indivisible

So we turn now to many-to-one matching with money, which is generally seen as a model of firms hiring workers

Bayesian games and their use in auctions. Vincent Conitzer

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

Mechanism Design and Auctions

Games with Private Information 資訊不透明賽局

Matching Markets and Google s Sponsored Search

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

EC476 Contracts and Organizations, Part III: Lecture 3

1 Intro to game theory

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

Large Multi-Unit Auctions with a Large Bidder

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

Parkes Auction Theory 1. Auction Theory. Jacomo Corbo. School of Engineering and Applied Science, Harvard University

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

Agent-Based Systems. Agent-Based Systems. Michael Rovatsos. Lecture 11 Resource Allocation 1 / 18

Francesco Nava Microeconomic Principles II EC202 Lent Term 2010

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

Columbia University. Department of Economics Discussion Paper Series. Bidding With Securities: Comment. Yeon-Koo Che Jinwoo Kim

Auctioning a Single Item. Auctions. Simple Auctions. Simple Auctions. Models of Private Information. Models of Private Information

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

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

ECON106P: Pricing and Strategy

Auctions and Optimal Bidding

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

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

Practice Problems 2: Asymmetric Information

Final Exam (100 Points Total)

Sequential-move games with Nature s moves.

UNOBSERVED MECHANISMS

HW Consider the following game:

Simon Fraser University Spring 2014

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

Economics 101A (Lecture 21) Stefano DellaVigna

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

1. The precise formula for the variance of a portfolio of two securities is: where

Signaling in an English Auction: Ex ante versus Interim Analysis

Introduction to Multi-Agent Programming

Blind Portfolio Auctions via Intermediaries

Answer Key: Problem Set 4

Economics Honors Exam 2008 Solutions Question 1

All Equilibrium Revenues in Buy Price Auctions

The Optimality of Being Efficient. Lawrence Ausubel and Peter Cramton Department of Economics University of Maryland

Descending Price Optimally Coordinates Search. INFORMS, Nov 2018

Auction Theory Lecture Note, David McAdams, Fall Bilateral Trade

Transcription:

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, 1]) Theorem In any auction such that in equilibrium: the winner with the highest valuation wins, and the bidder with the lowest possible valuation pays nothing, the average revenue are the same, and the average bidder profits are the same. DP, SP, FP and AP share the properties that equilibrium outcome is efficient (i.e. the highest value bidder wins the auction) a bidder with a 0 valuation pays nothing.

Envelope theorem Consider a maximization problem max b u(b, v) where u() is differentiable in b and v The solution b (v) is a function of v and satisfies the FOC u b (b (v), v) = 0 The value of the maximization problem is U(v) u(b (v), v) and by the chain rule of differentiation U (v) = u b (b (v), v)b (v) + u v (b (v), v) The envelope theorem says that U (v) = u v (b (v), v)

Envelope theorem and auctions A bidder with valuation v choosing to submit a bid b solves max b vpr(win b) E[Payment b] In an auction the objective function is u(b, v) = vpr(win b) E[Payment b] u v (b, v) = Pr(win b) If b (v) is the equilibrium bidding strategy, the envelope theorem says that the bidder expected profit U(v) satisfies U (v) = Pr(win b (v)) = Eq. Prob. value-v bidder wins Integrating v U(v) = U(0) + Pr(win ṽ)dṽ 0

Revenue equivalence theorem v U(v) = U(0) + Pr(win ṽ)dṽ 0 A bidder expected profit only depends on his probability of winning as function of his valuation (i.e. Pr(win ṽ)) his expected profit when he has the lowest possible valuation (i.e. U(0)) Both are identical across the four auction formats we considered Critical assumptions bidder know their own values (their values do not depend on others private information) values are statistically independent bidders only care about their profit (i.e. payoff equals valuation minus price paid)

Using the Revenue equivalence theorem The revenue equivalence theorem implies that: in any auction where, in equilibrium, the highest valuation bidder wins the object the expected revenue to the seller is constant the expected surplus to each bidder is constant In a second price auction: the highest value bidder wins the object equilibrium strategies are easily characterized (dominant strategy) bidders expected surplus and sellers revenue are easily characterized Can use the bidder expected revenue characterization in a second price auction to derive the (less obvious) equilibrium strategies of other auctions

First price auction Two bidders - valuations are independent draws from U[0, 1] Second price auction Each bidder bids his valuation A bidder with valuation v wins with probability v (i.e. the probability his opponent value is less than v) the expected payment upon winning is v/2 (i.e. the expected valuation of his opponent, provided his opponent has a valuation smaller than v) First price auction Suppose, in equilibrium, the highest valuation bidder wins A bidder with valuation v wins with probability v (i.e. the probability his opponent value is less than v) by the revenue equivalence theorem, his expected payment upon winning must be the same as in a SP auction (i.e. v/2) since the payment of the winner in a FP auction equals his own bid, the equilibrium bid of a bidder with valuation v must be v/2 (i.e. the equilibrium bidding strategy is b(v) = v/2.)

All pay auction Each bidder submits a sealed bid Bids are open Bidder who submitted the highest bid wins the object Each bidder pays a price to the seller equal to his own bid What should bidders do? Suppose there is an equilibrium where the highest valuation bidder wins use the revenue equivalence theorem to solve for the candidate equilibrium bidding strategies ex-post verify that the strategies constitute an equilibrium (i.e. no bidder has any incentive to deviate)

All pay auction Two bidders - valuations are independent draws from U[0, 1] Suppose, in equilibrium, the highest valuation bidder wins A bidder with valuation v wins with probability v (i.e. the probability his opponent value is less than v) pays his own bid, b(v), regardless of whether he wins or not his expected profit is then Prob(win v) v b(v) = v 2 b(v) in a second price auction has an expected profit of v(v v/2) = v 2 /2 from the revenue equivalence theorem v 2 b(v) = v 2 /2 the equilibrium bidding strategy in an all pay auction must be b(v) = v 2 /2

Auction with a reserve price A reserve price is a price below which the seller is not willing to give up the object Second price auction with a reserve price r the highest bidder wins the object if bid > r the winner pays a price equal to the largest between the second highest bid and the reserve price r Example 1: Two bids, 0.3 and 0.6, and reserve price r = 0.4. The high bidder wins and pays 0.4. Example 2: Two bids, 0.5 and 0.6, and reserve price r = 0.4. The high bidder wins and pays 0.5. Example 1: Two bids, 0.3 and 0.36, and reserve price r = 0.4. Nobody wins, object remains with seller.

Second price auction with reserve price Two bidders - valuations are independent draws from U[0, 1] It is a dominant strategy to: bid own valuation when v > r not bid when v r (or bid own valuation) A bidder with valuation v > r wins with probability v when winning pays a price equal to: opponent value, ˆv, if ˆv > r (happens with probability (v r)/v) reserve price, r, if ˆv r (happens with probability r/v) expected payment when winning (r/v) r + ((v r)/v) (v + r)/2 = r + (v r) 2 /(2v)

First price auction with reserve price Two bidders - valuations are independent draws from U[0, 1] Suppose, in equilibrium, the highest valuation bidder wins A bidder with valuation v does not bid if v r (dominant strategy) bids b(v) = r + (v r) 2 /(2v) if v > r (by the revenue equivalence theorem) note that r + (v r) 2 /(2v) is strictly increasing in v, so in equilibrium the highest value bidder wins

Optimal reserve price What reserve price maximizes the seller s revenue? Suppose there is just one bidder, with U[0, 1] valuation reserve price is just a posted price sell at price equal r if v > r do not sell otherwise Expected revenue is Prob(v > r) r = (1 r) r monopolist s revenue with demand function Q(p) = 1 p revenue maximizing reserve price r = 1/2 same as monopolist price

Optimal reserve price Two bidders - independent U[0, 1] valuations Compare the revenue from marginally increasing the reserve price r to r + ɛ, across all possible pairs of valuations v l < v h r + ɛ 0 v l v h l rv h v l v h v h 1 v l < v h < r no impact on revenue r + ɛ < v l < v h v l < r < v h v l < r < v h < r + ɛ no impact on revenue R increases by ɛ (probability 2r(1 r)) R decreases by r (probability 2ɛr) Expected revenue change: ΔRevenue = ɛ2r(1 r) r2ɛr must be zero at the optimal reserve price r = 1/2

Optimal reserve price With N > 2 bidders same argument applies The revenue only depends on the highest two bids Similar calculation of impact on revenue Optimal reserve price remains r = 1/2 First price, second price, ascending price and descending price auctions all have the same optimal reserve price Optimal reserve price in an all pay auction? Use the revenue equivalence theorem Bidders with valuation below r bid nothing For v r, solve for bidding strategy, b(v), using the revenue equivalence theorem Reserve price must be equal to b(r ) if it higher, the allocation rule is not the same as in the second price auction if it is lower a bidder with value r would have an incentive to lower its bid Homework: calculate the optimal reserve price with two bidders