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

Similar documents
Strategy -1- Strategic equilibrium in auctions

Elements of auction theory. This material is not part of the course, but is included here for those who are interested

Games with Private Information 資訊不透明賽局

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

Social Network Analysis

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

Microeconomics II. CIDE, Spring 2011 List of Problems

Bayesian games and their use in auctions. Vincent Conitzer

Strategy -1- Strategy

Lecture 6 Applications of Static Games of Incomplete Information

Experiments on Auctions

Auctions: Types and Equilibriums

Problem Set 3: Suggested Solutions

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

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

1 Theory of Auctions. 1.1 Independent Private Value Auctions

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

ECO 426 (Market Design) - Lecture 9

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

Auction Theory: Some Basics

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

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

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

CUR 412: Game Theory and its Applications, Lecture 4

Auction is a commonly used way of allocating indivisible

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

CUR 412: Game Theory and its Applications, Lecture 4

KIER DISCUSSION PAPER SERIES

1 Intro to game theory

Revenue Equivalence and Mechanism Design

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

ECO 426 (Market Design) - Lecture 8

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

Bidding rings and the winner s curse

Auctions. N i k o l a o s L i o n i s U n i v e r s i t y O f A t h e n s. ( R e v i s e d : J a n u a r y )

Problem Set 3: Suggested Solutions

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

Bayesian Nash Equilibrium

Auctions and Common Property

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

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

ECON Microeconomics II IRYNA DUDNYK. Auctions.

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

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

Microeconomic Theory III Spring 2009

Algorithmic Game Theory

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

Chapter 17 Auctions and Bargaining. Outline. Auctions

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

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

Game Theory Lecture #16

Revenue Equivalence and Income Taxation

EconS Games with Incomplete Information II and Auction Theory

University of Hong Kong

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

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

Game Theory and Auctions

Auction Theory for Undergrads

Econ 101A Final exam May 14, 2013.

Auctions and Optimal Bidding

Chapter 3. Dynamic discrete games and auctions: an introduction

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

Optimal Bidding Strategies for Simultaneous Vickrey Auctions with Perfect Substitutes

All Equilibrium Revenues in Buy Price Auctions

Multiple Choice POINTS: 1. QUESTION TYPE: Multiple Choice HAS VARIABLES: False NATIONAL STANDARDS: United States - BPROG: Analytic

HW Consider the following game:

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

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

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

On Existence of Equilibria. Bayesian Allocation-Mechanisms

Sequential-move games with Nature s moves.

Introduction to Economics I: Consumer Theory

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

Day 3. Myerson: What s Optimal

Auction. Li Zhao, SJTU. Spring, Li Zhao Auction 1 / 35

Game Theory: Additional Exercises

Auctions in the wild: Bidding with securities. Abhay Aneja & Laura Boudreau PHDBA 279B 1/30/14

Right to choose in oral 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

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

A Systematic Presentation of Equilibrium Bidding Strategies to Undergradudate Students

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

VI. Continuous Probability Distributions

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

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

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

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

Auction Theory - An Introduction

Revenue Equivalence Theorem (RET)

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

Descending Price Optimally Coordinates Search. INFORMS, Nov 2018

1. Players the agents ( rms, people, countries, etc.) who actively make decisions

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

ECON106P: Pricing and Strategy

Econ 101A Final exam May 14, 2013.

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

Mechanism Design and Auctions

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

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

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

Transcription:

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 starts a clock with high price and lets the clock tick down until a uyer cries out stop y sealed first-price (high-id) auction. Sealed ids. High idder pays his id. If a tie, the winner is assigned at random. By sealed second-price auction Sealed ids. This time high idder pays the second highest id. Tie rule as aove. What does game theory have to say aout the equilirium outcome? In the ascending price and sealed second-price auctions, there is a dominant strategy equilirium. In the former, stay in up to your valuation. In the latter, suppose idder i ids lower than his valuation ** *** * i v i * If the highest of the other ids is, uyer i loses if he ids either v i or ** < v. If the highest of the other ids is ** i i uyer i wins and ays *** The only time it matters is if the highest of the other ids is etween i and v i. In this case uyer i wishes he had id higher since he could have *** profited y v i..

Simple example: Auction off a $0 ill Sealed high-id auction with 0 cent raises Can you see why there can e no pure strategy equilirium id less than $9.90? If other idders id $9.90, your est response is to id the same since you may then win the coin toss. If other idders id $0.00, you can do no etter than id the same. (Of course you could also id zero. However it is not an equilirium for all ut one to id zero. Why is this? With two equiliria, which is more likely? Apply the Pareto criterion. All uyers are etter off in the first equilirium so it seems reasonale that they would all choose to id $9.90. Dutch auction with a 0 cent tick. See if you can explain why idding $9.90 must again e the an equilirium.. Auctions with private information Two idders. Each idder knows his own valuation ut neither knows the valuation of his opponent. Each elieves his opponents valuation is equally likely to e anywhere etween 0 and 00. What is a strategy in a private information game? v Valuations Bids A strategy is a plan indicating what to do for every possile information that a player may have. In this case, every possile valuation.

Can theory guide idders? Sealed high id auction Suppose you thought your opponent was going to id his full valuation (overly aggressive.) How aggressive should you e if your valuation is 00? ------------ If you id 0 you win with proaility 0/00 0 with proaility 0/00 60 with proaility 60/00 with proaility /00 Expected gain = Pr{opponent ids less than } profit u( v, ) = ( v ) = ( v ) 00 00 Differentiating y, u = ( v ) 00 = 0at= v. 3

Extending this argument, suppose that your opponent adopts a linear strategy: = a v. What should you do? = a v / a v If you id you win with proaility Pr{ < } = Pr{ a v < } = Pr{ v < } a But values are evenly distriuted. Thus v < =. Pr{ v v} 00 Then uyer s win proaility is 00a His expected gain is therefore uv (, ) = ( v ) ( v ) 00a = 00a. Arguing as efore, uyer s est response is = v. 4

Appealing to the symmetry of the game, each therefore has a est response = v. i i Comparison with the open ascending id auction. In the open auction, if you win and your valuation is 60, what do you expect to pay? 40, what do you expect to pay? v, what do you expect to pay? v/ In the sealed high id auction, if you win when your valuation is v you pay = v/. Thus the expected payments are the same in the two auctions. It follows immediately that the expected receipts of the seller (the revenue) is the same as well. Revenue equivalence theorem If (a) valuations are independent draws from the same distriution and () idders are risk neutral Then equilirium idding results in the same expected winning id and hence the same expected revenue. Sealed high-id Auctions with more than idders. Revenue equivalence theorem continues to hold 5

Reserve prices? (Revenue equivalence still holds) "Auction" with idder. Reserve price r 0 0 0 30 40 50 60 70 80 Pr{sale} 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0. Expected revenue 0 9 6 4 5 4 6 Another way to answer the question. Consider the sealed second price auction. Let the possile valuations e 0,,,.,v. Let f t e the proaility that the valuation is t. Suppose that the reserve price is raised from t to t+. A particular uyer only affects the outcome if he is the only one with a valuation of t or higher. [Why is this?]. Conditional upon this eing the case, with proaility f t the item is not sold. The seller thus gets to keep the item rather than sell it at a price of t. With proaility Ft = ft+ + ft+ +... + fv the price is sold for $ more. The expected profit is therefore ftt+ Gt In the uniform case with values on [0,00] t Then ft t G t = t+ (00 t ) = 99 t > 0 f = and G = 00 ( t+ ) + if and only if t > 49. Thus the profit maximizing reserve price is 50. t 6

Class exercises:. What if valuations are uniformly distriuted on [00,00]?. What if the sellers valuation is s? Risk aversion Consider the Dutch auction. How does it fare in comparison with the sealed high-id and open ascending id auctions? Modelling Utility gain U(x) x Monetary gain 7

Special case: U( x) = x α, 0< α < Consider the uniform case with idders. Suppose your opponent s strategy is linear. = θ v. If you id you win if = θv (this is exact only if you win all ties.) That is if v < θ In the uniform case the proaility of this event, Pr{ v } = θ 00 θ Buyer s expected utility is therefore α α e( ) = Pr{ v } U( v ) = ( v ) = [ ( v ) ] θ 00θ 00θ It is left as an exercise to show that this is maximized if = v. + α Auctions with more than item Example: Bidder s valuations: 80, 60 Bidder s valuations: 50, 0 Bidder s valuations: 30, 5 Consider the open ascending id auction 8