Week 61 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz

Slides:



Advertisements
Similar presentations
(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
Advertisements

Network Economics -- Lecture 4: Auctions and applications Patrick Loiseau EURECOM Fall 2012.
Auction Theory Class 5 – single-parameter implementation and risk aversion 1.
Class 4 – Some applications of revenue equivalence
Yang Cai Oct 01, An overview of today’s class Myerson’s Auction Recap Challenge of Multi-Dimensional Settings Unit-Demand Pricing.
EC941 - Game Theory Prof. Francesco Squintani Lecture 4 1.
CPS Bayesian games and their use in auctions Vincent Conitzer
Seminar in Auctions and Mechanism Design Based on J. Hartline’s book: Approximation in Economic Design Presented by: Miki Dimenshtein & Noga Levy.
Auctions. Strategic Situation You are bidding for an object in an auction. The object has a value to you of $20. How much should you bid? Depends on auction.
Intermediate Microeconomics Midterm (50%) (4/27) Final (50%) (6/22) Term grades based on relative ranking. Mon 1:30-2:00 ( 社科 757)
An Approximate Truthful Mechanism for Combinatorial Auctions An Internet Mathematics paper by Aaron Archer, Christos Papadimitriou, Kunal Talwar and Éva.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2007 Lecture 2 – Sept
On Cheating in Sealed-Bid Auctions Ryan Porter Yoav Shoham Computer Science Department Stanford University.
Auction. Types of Auction  Open outcry English (ascending) auction Dutch (descending) auction  Sealed bid First-price Second-price (Vickrey)  Equivalence.
Private-value auctions: theory and experimental evidence (Part I) Nikos Nikiforakis The University of Melbourne.
Auction Theory Class 3 – optimal auctions 1. Optimal auctions Usually the term optimal auctions stands for revenue maximization. What is maximal revenue?
Optimal auction design Roger Myerson Mathematics of Operations research 1981.
Week 9 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2008 Lecture 4 – Sept
6.853: Topics in Algorithmic Game Theory Fall 2011 Matt Weinberg Lecture 24.
Week 21 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz
Continuous Random Variables. For discrete random variables, we required that Y was limited to a finite (or countably infinite) set of values. Now, for.
Week 2 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Week 7 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Week 31 COS 444 Internet Auctions: Theory and Practice Spring 2010 Ken Steiglitz
Week 5 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Week 10 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Week 10 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Week 8 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Week 71 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz
Week 4 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Week 41 COS 444 Internet Auctions: Theory and Practice Spring 2010 Ken Steiglitz
Week 51 COS 444 Internet Auctions: Theory and Practice Spring 2010 Ken Steiglitz
Competitive Analysis of Incentive Compatible On-Line Auctions Ron Lavi and Noam Nisan SISL/IST, Cal-Tech Hebrew University.
Week 3 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Yang Cai Sep 15, An overview of today’s class Myerson’s Lemma (cont’d) Application of Myerson’s Lemma Revelation Principle Intro to Revenue Maximization.
Week 11 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Week 81 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz
Static Games of Incomplete Information.. Mechanism design Typically a 3-step game of incomplete info Step 1: Principal designs mechanism/contract Step.
Chapter 19 Equivalence Types of Auctions Strategic Equivalence
Auction Theory Class 2 – Revenue equivalence 1. This class: revenue Revenue in auctions – Connection to order statistics The revelation principle The.
© 2009 Institute of Information Management National Chiao Tung University Lecture Note II-3 Static Games of Incomplete Information Static Bayesian Game.
Auction Seminar Optimal Mechanism Presentation by: Alon Resler Supervised by: Amos Fiat.
IELM 231: IT for Logistics and Manufacturing Course Agenda Introduction IT applications design: Human-Computer Interface Fundamental IT tools: sorting,
Yang Cai Oct 08, An overview of today’s class Basic LP Formulation for Multiple Bidders Succinct LP: Reduced Form of an Auction The Structure of.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2009 Lecture 4.
Topic 2: Designing the “optimal auction” Reminder of previous classes: Discussed 1st price and 2nd price auctions. Found equilibrium strategies. Saw that.
Unlimited Supply Infinitely many identical items. Each bidder wants one item. –Corresponds to a situation were we have no marginal production cost. –Very.
Optimal mechanisms (part 2) seminar in auctions & mechanism design Presentor : orel levy.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2007 Lecture 3 – Sept
Yang Cai Oct 06, An overview of today’s class Unit-Demand Pricing (cont’d) Multi-bidder Multi-item Setting Basic LP formulation.
Static Games of Incomplete Information
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
STA347 - week 91 Random Vectors and Matrices A random vector is a vector whose elements are random variables. The collective behavior of a p x 1 random.
Lecture 4 Multiunit Auctions and Monopoly The first part of this lecture put auctions in a more general context, by highlighting the similarities and differences.
Risk Aversion and Optimal Reserve Prices in First and Second-Price Auctions Audrey Hu University of Amsterdam Stephen A. Matthews University of Pennsylvania.
Advanced Subjects in GT Prepared by Rina Talisman Introduction Revenue Equivalence The Optimal Auction (Myerson 1981) Auctions.
Lecture 4 on Auctions Multiunit Auctions We begin this lecture by comparing auctions with monopolies. We then discuss different pricing schemes for selling.
Comp/Math 553: Algorithmic Game Theory Lecture 10
Auction Theory.
Comp/Math 553: Algorithmic Game Theory Lecture 13
Market Design and Analysis Lecture 4
COS 444 Internet Auctions: Theory and Practice
Economics 100C: April 8, 2010 April 8, 2010.
Information, Incentives, and Mechanism Design
CPS Bayesian games and their use in auctions
Presentation transcript:

week 61 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz

week 62 Assignment 3: discussion 3.1 Techniques for average-of-losing-bids auction 3.2 Best response 3.3 How can we encourage (subsidize?) early entry?

week 63 Conditional expectation Intuitively clear, very useful in auction theory If x is a random variable with cdf H, and A is an event, define the conditional expectation of x given A: Not defined when prob{ A } = 0.

week 64 Two quick examples of conditional expectation 1)Suppose x is uniformly distributed on [0,1]. What is the expected value of x given that it is less than a constant c ≤ 1? 2)Given two independent draws x 1 and x 2, what is the expected value of x 1, given that x 1 ≤ x 2 ?

week 65 Interpretation of FP equil. Now take a look once more at the equilibrium bidding function for a first-price IPV auction: I claim this has the form of a conditional expectation. What is the event A?

week 66 Interpretation of FP equil. Claim: event A = you win! = {Y 1,(n-1) ≤ v }, where Y 1,(n-1) = highest of (n-1) independent draws To check this Let y = Y 1,(n-1), the “next highest value”. The cdf of y = Y 1,(n-1) is F(v) n-1 so the integral in the expected value of y given that you win is

week 67 Interpretation of FP equil. Therefore, That is, in equilibrium, bid the expected next-highest value conditioned on your winning. …Intuition?

week 68 Stronger revenue equivalence Let P sp (v) be the expected payment in equilibrium of a bidder in a SP auction (and similarly for FP). So SP and FP are revenue equivalent for each v !

week 69 Graphical interpretation Once again, by parts:

week 610 Bidder preference revelation Theorem: Theorem: Suppose there exists a symmetric Bayesian equilibrium in an IPV auction, and assume high bidder wins. Then this equilibrium bidding function is monotonically nondecreasing. *Thanks to Dilip Abreu for describing this elegant proof.

week 611 Bidder preference revelation Proof:Proof: Bid as if your value is z when it’s actually v. Let w(z) = prob. of winning as fctn. of z p(z) = exp. payment as fctn. of z For convenience, let w=w(v), w΄=w(v΄), p=p(v), p΄=p(v΄), for any v, v΄.

week 612 Bidder preference revelation From the definition of equilibrium, the expected surplus satisfies: v·w – p ≥ v·w΄ – p΄ v΄·w΄ – p΄ ≥ v΄·w – p for every v,v΄. Add: (v – v΄ )·(w – w΄) ≥ 0. So v > v΄ → w ≥ w΄ → b(v) ≥ b(v΄). □

week 613 Example of an IPV auction with no symmetric Bayesian equil.: third-price (see Krishna 02, p. 34)

week 614 Riley & Samuelson 1981: Optimal Auctions Optimal Auctions Elegant, landmark paper, constructs the benchmark theory for optimal IPV auctions with reserves Paradoxically, gets more powerful results more easily by generalizing

week 615

week 616

week 617 Riley & Samuelson’s class A rs 1.One seller, one indivisible object 2.Reserve b 0 (open reserve, starting bid) 3.n bidders, with valuations v i i=1,…,n 4.Values iid according to cdf F, which is strictly increasing, differentiable, with support [0,1] ( so f > 0 ) 5.There is a symmetric equilibrium bidding function b(v) which is strictly increasing (we know by preference revelation it must be nondecreasing) 6.Highest acceptable bid wins 7.Rules are anonymous

week 618 Abstracting away… Bid as if value = z, and denote expected payment of bidder by P(z). Then the expected surplus is For an equilibrium, this must be max at z=v, so differentiate and set to 0:

week 619 We need a boundary condition… Denote by v * the value at which it becomes profitable to bid positively, called the entry value: Now integrate d.e. from v * to our value v 1 :

week 620 Once more, integrate by parts… And use the boundary condition: A truly remarkable result! Why?

week 621 Once more, integrate by parts… And use the boundary condition: A truly remarkable result! Why? Where is the auction form? FP? SP? Third-price? All-pay? …

week 622 Revenue Equivalence Theorem Theorem: Theorem: In equilibrium the expected revenue in an (optimal) Riley & Samuelson auction depends only on the entry value v * and not on the form of the auction. □

week 623 Marginal revenue, or virtual valuation Let’s put some work into this expected revenue: And integrate by parts (of course, what else?)…

week 624 Marginal revenue, or virtual valuation

week 625 Interpretation of marginal revenue Because F(v) n is the cdf of the highest, winning value, we can interpret this as saying: The expected revenue of an (optimal) Riley & Samuelson auction is the expected marginal revenue of the winner.

week 626 Hazard rate Let the failure time of a device be distributed with pdf f(t) and pdf F(t). Define the “survival function” = R(t) = prob. of no failure before time t = prob. of survival till time t. Since F(t) = prob. of failure before t, R(t) = 1 – F(t).

week 627 Hazard rate The conditional prob. of failure in the interval (t, t+Δt ], given survival up to time t, is The “Hazard Rate” is the limit of this divided by Δt as Δt → 0 :

week 628 Hazard rate Thus, the marginal revenue, which is key to finding the expected revenue in a Riley- Samuelson auction, is 1/HR is the “Inverse Hazard Rate”

week 629 Why call it “marginal revenue”? Consider a monopolist seller who makes a take- it-or-leave-it offer to a single seller at a price p. The buyer has value distribution F, so the prob. of her accepting the offer is 1–F(p). Think of this as the buyer’s demand curve. She buys, on the average, quantity q = 1–F(p) at price p. Or, what is the same thing, the seller offers price p(q) = F -1 (1– q) to sell quantity q. after Krishna 02, BR 89

week 630 Why call it “marginal revenue”? The revenue function of the seller is therefore q·p(q) = q F -1 (1-q), the revenue derived from selling quantity q. The derivative of this wrt q is by definition the marginal revenue of the monopolist : F -1 (1-q) = p, so this is □