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

Slides:



Advertisements
Similar presentations
Yossi Sheffi Mass Inst of Tech Cambridge, MA ESD.260J/1.260J/15.
Advertisements

(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
Network Economics -- Lecture 4: Auctions and applications Patrick Loiseau EURECOM Fall 2012.
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.
1 Auctioning Many Similar Items Lawrence Ausubel and Peter Cramton Department of Economics University of Maryland.
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.
Chapter 25: Auctions and Auction Markets 1 Auctions and Auction Markets.
Intermediate Microeconomics Midterm (50%) (4/27) Final (50%) (6/22) Term grades based on relative ranking. Mon 1:30-2:00 ( 社科 757)
Bidding Strategy and Auction Design Josh Ruffin, Dennis Langer, Kevin Hyland and Emmet Ferriter.
Auctions Auction types: –First price, sealed bid auction –Second price, sealed bid auction –English auction (ascending bid auction) –Dutch auction (descending.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2007 Lecture 2 – Sept
Michael R. Baye, Managerial Economics and Business Strategy, 3e. ©The McGraw-Hill Companies, Inc., 1999 Managerial Economics & Business Strategy Chapter.
Kagel & Levin: The Winner’s Curse and Public Information in Common Value Auctions Economics 328 Spring 2004.
On Cheating in Sealed-Bid Auctions Ryan Porter Yoav Shoham Computer Science Department Stanford University.
Welcome Auctions Jonathan D. Wareham
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.
Auctions Ruth Tarrant. Classifying auctions What is the nature of the good being auctioned? What are the rules of bidding? Private value auction Common.
Auction Theory Class 3 – optimal auctions 1. Optimal auctions Usually the term optimal auctions stands for revenue maximization. What is maximal revenue?
Week 9 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Liz DiMascio Paige Warren- Shriner Mitch Justus DUTCH AND ENGLISH AUCTIONS IN RELATION TO THE TULIP MARKET.
Wars of Attrition. Examples Price wars fought to drive out new entrants into some market Holland Sweetener Rate cutting by KiwiAir competitors Browser.
Common value auctions The same value for everyone, but different bidders have different information about the underlying value.
Class 7 – Common Values, Winner’s curse and Interdependent Values.
“Everything is worth what its purchaser will pay for it.”
Auctions. An auction is a process of buying and selling goods or services by offering them up for bid ( The price at which a buyer is willing to close.
Biased Price Signals and Reaction of Bidders in Vickrey Auction IPOs Aytekin Ertan December 2009.
Week 21 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz
Week 1 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
1 Teck-Hua Ho April 18, 2006 Auction Design I. Economic and Behavioral Foundations of Pricing II. Innovative Pricing Concepts and Tools III. Internet Pricing.
Chapter Seventeen Auctions. Who Uses Auctions? u Owners of art, cars, stamps, machines, mineral rights etc. u Q: Why auction? u A: Because many markets.
1 Teck-Hua Ho April 22, 2006 Auction Design I. Economic and Behavioral Foundations of Pricing II. Innovative Pricing Concepts and Tools III. Internet Pricing.
Week 31 COS 444 Internet Auctions: Theory and Practice Spring 2010 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
Outline  In-Class Experiment on First-Price Sealed-Bid Auctions  Professor John Morgan: Internet Auctions  The Winner’s Curse Hypothesis: Kagel and.
Week 41 COS 444 Internet Auctions: Theory and Practice Spring 2010 Ken Steiglitz
Week 61 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz
Week 11 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
and Lecture Notes in Game Theory1 Game Theory Applications: Lecture Notes Course Website u Galina.
Week 81 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz
This Week’s Topics  Review Class Concepts -Auctions, continued -Repeated Games -Bertrand Trap & Anti-Trust -Auctions.
Introduction to Auctions David M. Pennock. Auctions: yesterday Going once, … going twice,...
© 2009 Institute of Information Management National Chiao Tung University Lecture Note II-3 Static Games of Incomplete Information Static Bayesian Game.
IELM 231: IT for Logistics and Manufacturing Course Agenda Introduction IT applications design: Human-Computer Interface Fundamental IT tools: sorting,
Games People Play. 12: Auctions Games People Play. Auctions In this section we shall learn How different types of auctions allocate goods How to buy.
INFORMATION ASYMMETRIES IN COMMON VALUE AUCTIONS WITH DISCRETE SIGNALS Vasilis Syrgkanis Microsoft Research, NYC Joint with David Kempe, USC Eva Tardos,
Auctions and Bidding. 2 Auction Theory Auction theory is important for practical reason empirical reason –testing-ground for economic theory, especially.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2009 Lecture 4.
Gabor Fath Research Institute for Solid State Physics, HAS, Budapest Miklos Sarvary INSEAD, Fontainebleau Should prices be always lower on the Internet?
Data Analysis Econ 176, Fall Populations When we run an experiment, we are always measuring an outcome, x. We say that an outcome belongs to some.
Auctions An auction is a mechanism for trading items by means of bidding. Dates back to 500 BC where Babylonians auctioned of women as wives. Position.
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.
Auctions Great Lakes Institute of Management, Chennai March 4, 2012.
First Price common value auctions: Bidder behavior and the winner’s curse John Kagel, Dan Levin, Raymon Battaglio & Donal Meyer.
Incomplete Information and Bayes-Nash Equilibrium.
Advanced Subjects in GT Prepared by Rina Talisman Introduction Revenue Equivalence The Optimal Auction (Myerson 1981) Auctions.
Oil Lease Auctions and the Winners’ Curse. Geologists’ estimates of value differ widely Company that makes highest estimate bids the highest. Often loses.
Common Value Auctions 1. Coin auction What’s for sale: the coins in this jar. Second price sealed bid auction. Write down your bid. 2.
Bayesian games and their use in auctions
Bidding on an Antique.
Asymmetric auctions with resale: an experimental study
CPS Bayesian games and their use in auctions
Presentation transcript:

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

week 102 The common-value model All buyers have the same actual value, V. Buyers are uncertain about this value: thus not private values. Efficiency not relevant. Buyers estimate values variously, by consulting experts, say. We say they receive “noisy signals” that are correlated with the true value. In a popular special case, buyers receive the signals s i = V + n i, where n i is a zero-mean random process common to all buyers. We can think of real-world bidders as living in the range between IPV and common-value.

week 103 Winner’s Curse The paradigmatic experiment: bid on a jar of nickels The systematic error is to fail to take into account the fact that winning may be an informative event! A persistent violation of the beloved hypothesis of homo economicus, the rational self-interested actor. Can be considered a “cognitive illusion”

week 104 From the archives

week 105 Buy-a-Company experiment [R.H. Thaler, The Winner’s Curse, 1992] reports the unpublished results of Weiner, Bazerman, & Carroll, 1987 with Bidding for Paramount. 69 NWU MBA students played the game 20 rounds each, with financial incentives and feedback after each trial.  5 learned to bid ≤ $1 by end, after avg. of 8 trials  No sign of learning among the others!

week 106 Winner’s Curse, references Seminal paper: E.C. Capen, R.V. Clapp, W.M. Campbell, “Competitive bidding in high-risk situations,” J. Petroleum Technology, 23, 1971, pp E.C. Capen, R.V. Clapp, W.M. Campbell, “Competitive bidding in high-risk situations,” J. Petroleum Technology, 23, 1971, pp See: R. Thaler, The Winner’s Curse: Paradoxes and Anomalies of Economic Life, Princeton Univ. Press, J.H. Kagel and D. Levin, Common value auctions and the Winner’s curse, Princeton Univ. Press, 2002.

week 107 Claims of Winner’s Curse in the field Oil industry Book publication rights Professional baseball free-agent market [Blecherman & Camerer 96] Corporate takeover battles Real-estate auctions Stock market investments, IPOs Blind bidding by movie exhibitors Construction industry … etc. … but difficult to prove using field data because of the existence other factors

week 108 What do you do if you find your competitors are making consistent errors?

week 109 What do you do if you find your competitors are making consistent errors? Publish. Share your knowledge. --- this lowers bids! [Thaler, pp , after Julia Grant]

week 1010 What do you do if you find your competitors are making consistent errors? Publish. Share your knowledge. --- this lowers bids! [Thaler, pp , after Julia Grant] When to share information and when to hide it?

week 1011 First laboratory experiment M.H. Bazerman and W.F. Samuelson, “I won the auction but I don’t want the prize,” J. Conflict Resolution, 27, pp , 1983.M.H. Bazerman and W.F. Samuelson, “I won the auction but I don’t want the prize,” J. Conflict Resolution M.B.A. students, Boston University Four first-price sealed-bid auctions 800 pennies; 160 nickels; 200 large paper 4¢; 400 small paper 2¢. All thus worth V = $8.00. [Kagel & Levin 02]

week 1012 From Bazerman & Samuelson 83  Shade  Curse

week 1013 Bazerman and Samuelson 83 Bidders were asked for estimates as well as bids. 48 auctions were run altogether. Average estimate was $5.13 = $8 – $2.87 Average winning bid was $10.01 = $8 + $2.01 The experimental design was sophisticated, subjects were told they were competing against different numbers of bidders, and the effects of uncertainty and group size measured [Kagel & Levin 02]

week 1014 Winning may be bad news, unless you shade appropriately Suppose bidders are uncertain about their values v i, receiving noisy signals s i Based on this information, your best estimate of your true value, after receiving the signal s i =x, is E[V | s 1 =x ] Suppose you, bidder 1, win the auction! Then your new best estimate of your value is E[V | s 1 =x, Y 1 < x ] < E[V | s 1 =x ] --- where Y 1 is the highest of the other signals Intuitive argument: [Krishna 02]. Conditions for proof?

week 1015 In first-price auctions Suppose n = number of bidders increases. According to the private-value equilibrium, you should increase your bid Taking into account the Winner’s Curse, you should decrease your bid (effect can dominate). Having the highest estimate among 5 bidders is not as bad as among 50.  Note that in any common-value auction, the winner’s curse results from a miscalculation, and does not occur in equilibrium… so what is that equilibrium?

week 1016 Winner’s curse, con’t Important paper, which describes how to find a symmetric equilibrium in one general setting: R.B. Wilson, “Competitive Bidding with Disparate Information,” Management Science 15, 7, March 1969, pp R.B. Wilson, “Competitive Bidding with Disparate Information,” Management Science 15, 7, March 1969, pp That is, how to compensate for the tendency to forget how likely it is for winning to be bad news, in equilibrium.

week 1017 Example: FP common-value, uncorrelated signals* Take the simple 2-bidder example where the true value of a tract is V = v 1 + v 2, where v 1, v 2 = amount of oil on parts 1, 2 of a tract. Bidder i knows v i with certainty, but not the other. The v i ’s are uniform iid on [0,1]. What is the equilbrium bid? Is it a “good” bid? How does this FP auction compare to the corresponding SP for the seller’s revenue? *From F.M. Menezes & P.K. Monteiro, An Intro. to Auction Theory, Oxford Univ. Press, 2005.

week 1018 Winning may be bad news: example In this common-value model: V = v 1 + v 2 E[V | v 1 ] = v 1 + ½ E[V | v 1 & (v 2 ≤ v 1 ) ] = v 1 + E[v 2 | v 2 ≤ v 1 ] = v 1 + v 1 / 2 ≤ v 1 + ½ = E[V | v 1 ]

week 1019 Example: FP common-value, uncorrelated signals [Menezes & Monteiro 05] We’ll look for a symmetric, differentiable, and increasing equil. bidding fctn. b(v). As usual, suppose bidder 1 bids as if her value is z. Her expected surplus (profit) is The equilibrium condition is

week 1020 Example: FP common-value, uncorrelated signals [Menezes & Monteiro 05] This differential equation is of a familiar, linear type: Integrate from 0 to v, letting b(0) = b 0. Note: we can’t assume b 0 = 0 … Why not? Argue from finiteness of b(0) that c= 0. … So

week 1021 Example: FP common-value, uncorrelated signals [Menezes & Monteiro 05] Notice that bidder i never pays more than the true value V.. But now suppose signals v i are distributed as F on [0,1], instead of being uniform. Exactly the same procedure gets us the symmetric equilibrium […is this always increasing?] Take the special case F = v θ, where θ > 0.

week 1022 Example: FP common-value, uncorrelated signals [Menezes & Monteiro 05] The symmetric equilibrium then becomes If θ > 1, the winning bidder may well bid higher, and hence pay more than, the true value V. …Is this an example of the Winner’s Curse?

week 1023 Example: SP common-value, uncorrelated signals [Menezes & Monteiro 05] In the SP auction with this common-value model, the equilibrium in the uniform case, using the same technique, is b(v) = 2v. This may be higher than the true value V, and the winner may very well pay more than V. In fact, she may pay more than the expected value of V conditional on having the highest bid. …What is that? Again, is this an example of the Winner’s Curse?

week 1024 Example: common-value, uncorrelated signals [Menezes & Monteiro 05] It turns out that the FP and SP auctions with this common-value model are revenue equivalent. In fact, this is generally true for common-value cases with independent signals [ Menezes & Monteiro 05, pp. 117ff ]. But revenue equivalence finally breaks down when the signals are correlated.

week 1025 Kagel & Levin’s Experimental work Kagel & Levin et al. did a lot of laboratory experimental work with this model: Choose the common value x 0 from the uniform distribution uniform on [x L, x H ], known to the bidders. The bidders are given signals drawn uniformly and independently from [x o –ε, x o +ε], where ε is known to the bidders. The signals in this case are correlated. [J.H. Kagel and D.Levin, Common value auctions and the Winner’s curse, Princeton Univ. Press, 2002]

week 1026 Dyer et al.’s comparison between experienced & inexperienced bidders Experiment was a procurement auction: one buyer, many sellers, so low bid wins Common-value model analogous to the ones in the Kagel-Levin experiments Compares performance of Univ. Houston Econ majors with executives in local construction companies with average of 20 years experience of bid preparation [D. Dyer, J.H. Kagel, & D. Levin, “A Comparison of NaïveD. Dyer, J.H. Kagel, & D. Levin, “A Comparison of Naïve & Experienced Bidders in Common-Value Offer Auctions: A Laboratory Analysis,” Econ. J., 99, , March 1989A Laboratory Analysis,” Econ. J., 99, , March 1989.]

week 1027 Results: Winner’s curse extends to procurement (offer) auctions Winner’s curse extends to auctions with only 4 bidders No significant difference in performance between undergrads and professionals! …Explain? [D. Dyer, J.H. Kagel, & D. Levin, “A Comparison of NaïveD. Dyer, J.H. Kagel, & D. Levin, “A Comparison of Naïve & Experienced Bidders in Common-Value Offer Auctions: A Laboratory Analysis,” Econ. J., 99, , March 1989A Laboratory Analysis,” Econ. J., 99, , March 1989.]

week 1028  Executives didn’t take the experiment seriously?  Executives’ auctions in practice have a strong private-value component (overhead, opportunity costs), and losses can be mitigated by renegotiation, or change-orders? Dyer et al. conclude, however, that “…executives have learned a set of situation specific rules of thumb which permit them to avoid the winner’s curse in the field but which could not be applied in the lab.” (by feedback or selection) Learning occurs “…Not through understanding and absorbing ‘the theory’, but from rules of thumb that are likely to breakdown under extreme changes, or truly novel, economic conditions.”

week 1029 Next… Common-value auctions lead to the next, and most general treatment of single-item auctions, Milgrom & Weber 82. The model here is called the “affiliated values” model, and represents a spectrum, with IPV at one extreme, and common-value at the other. Most auctions have elements of both. To wrap up the Winner’s Curse:

week 1030 Capen et al.’s fortune cookie: “He who bids on a parcel what he thinks it is worth, will, in the long run, be taken for a cleaning.”

week 1031 Milgrom & Weber 1982 affiliated values Revenue ranking, but only with symmetric bidders

week 1032 Interdependent Values In general, we relax two IPV assumptions: Bidders are no longer sure of their values (as in the common-value case discussed in connection with the Winner’s Curse) Bidders’ signals are statistically correlated; technically positively affiliated (see Milgrom & Weber 82, Krishna 02)Milgrom & Weber 82 Intuitively: if some subset of signals is large, it’s more likely that the remaining signals are large

week 1033 Major results in Milgrom & Weber 82 For the general symmetric, affiliated values model: English > 2 nd -Price > 1 st -Price = Dutch (“revenue ranking”) If the seller has private information, full disclosure maximizes price (“Honesty is the best policy” … in the long run)

week 1034 Milgrom & Weber 82: Caveats Symmetry assumption is crucial; results fail without it English is Japanese button model For disclosure result: seller must be credible, pre-committed to known policy Game-theoretic setting assumes distributions of signals are common knowledge

week 1035 The linkage principle (after Krishna 02) Consider the price paid by the winner when her signal is x but she bids as if her value is z, and denote this price by W (z, x). Define the linkage : = sensitivity of expected price paid by winner to variations in her received signal when bid is held fixed

week 1036 The linkage principle, con’t Result: Result: Two auctions with symmetric and increasing equilibria, and with W(0,0) = 0, are revenue-ranked by their linkages.Consequences: 1 st -Price: linkage L 1 = 0 2 nd -Price: price paid is linked through x 2 to x 1 ; so L 2 > 0 English: … through all signals to x 1 ; so L E > L 2 > L 1  revenue ranking