Week 11 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 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.
Private Information and Auctions. Auction Situations Private Value – Everybody knows their own value for the object – Nobody knows other peoples values.
Auction Theory Class 5 – single-parameter implementation and risk aversion 1.
CPS Bayesian games and their use in auctions Vincent Conitzer
1 Auctioning Many Similar Items Lawrence Ausubel and Peter Cramton Department of Economics University of Maryland.
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.
Michael R. Baye, Managerial Economics and Business Strategy, 3e. ©The McGraw-Hill Companies, Inc., 1999 Managerial Economics & Business Strategy Chapter.
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.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
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.
Introduction to Game Theory
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.
Week 101 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz
Strategic Bidding in Auctions
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.
Week 21 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz
Week 2 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 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.
Week 7 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
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.
VAMSEE KONERU PRADNYA SUTE
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
Auctioning one item PART 2 Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Common Value Auctions Professor Susan Athey Market Design Spring 2010.
Week 8 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 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
Week 61 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz
Week 3 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Game Theory April 9, Prisoner’s Dilemma  One-shot, simultaneous game  Nash Equilibrium (individually rational strategies) is not Pareto Optimal.
Managerial Economics & Business Strategy
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,...
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.
1 Risk and Information Chapter Chapter Fifteen Overview 1.Introduction: Amazon.com 2.Describing Risky Outcome – Basic Tools Lotteries and Probabilities.
Steffen Staab 1WeST Web Science & Technologies University of Koblenz ▪ Landau, Germany Network Theory and Dynamic Systems Auctions.
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.
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.
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
Tuomas Sandholm Computer Science Department Carnegie Mellon University
Bidding on an Antique.
COS 444 Internet Auctions: Theory and Practice
CPS Bayesian games and their use in auctions
Presentation transcript:

week 11 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz

week 112 Winner’s Curse o The paradigmatic experiment: bid on a jar of nickels o The systematic error is to fail to take into account the fact that winning may be an informative event! winning may be an informative event! o Caused by a cognitive illusion See Richard Thaler’s The Winner’s Curse: Paradoxes and Anomalies of Economic Life, Princeton University Press, 1992.

week 114 Winning is bad news, unless you shade o Suppose bidders are uncertain about their values V i, receiving noisy signals X i o Based on this information, your best estimate is E[V | X 1 ] o Suppose you, bidder 1, win the auction! o Then your new best estimate of your value is E[V | X 1, Y 1 < X 1 ] < E[V | X 1 ] --- where Y 1 is the highest of the other signals

week 115 Example: first-price auctions Common-value model: say the item has the same but unknown value to all bidders, and each bidder receives a noisy signal related to the true value Suppose the number of bidders increases. Then  According to the private-value equilibrium, you should increase your bid  Taking into account the Winner’s Curse, you should decrease your bid (often dominates)

week 116 Winner’s curse, con’t Important paper, which describes how to find a symmetric equilibrium: 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

week 117 Empirical results o In the laboratory the Winner’s Curse is real and persistent o Observed in practice: oil industry, baseball free agents, book publishing o Even professional bidders from the commercial construction industry succumb; (Dyer at al. suggest they learn situation- specific rules rather than the right theory [Thaler, p. 56] ) o What do you do if you find your competitors are making consistent errors? Publish! [Thaler, pp , after Julia Grant]

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

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

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

week 1112 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, denoted 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 1113 The linkage principle, con’t Proposition: 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 x 2 to x 1 ; so L 2 > 0 English: … through all signals to x 1 ; so L E > L 2 > L 1 L E > L 2 > L 1