Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.

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.
Chapter 20 Violating Equivalence 1.Preferences for Risk 2.Asymmetric Valuations 3.Relaxing Independence 4.Differential Information 5.Collusion and Entry.
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.
Nash Equilibrium: Illustrations
EC941 - Game Theory Prof. Francesco Squintani Lecture 4 1.
CPS Bayesian games and their use in auctions Vincent Conitzer
Economics 100B u Instructor: Ted Bergstrom u T.A. Oddgeir Ottesen u Syllabus online at (Class pages) Or at
1 Auctions, I V.S. Subrahmanian. Fall 2002, © V.S. Subrahmanian 2 Auction Types Ascending auctions (English) Descending auctions (Dutch) Vickrey Auctions.
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.
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.
Multi-item auctions with identical items limited supply: M items (M smaller than number of bidders, n). Three possible bidder types: –Unit-demand bidders.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Game Theory “A cynic knows the price of everything and the value of nothing” - Oscar Wilde, Lady Windemere’s Fan Mike Shor Lecture 11.
Welcome Auctions Jonathan D. Wareham
1 Chapter 6: Auctions SCIT1003 Chapter 6: Auctions Prof. Tsang.
Auctions Julina, Hales, Lauren, and Jaki. Definitions Auction: a process of buying and selling goods through bids for an optimal price. Auctions must.
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.
The Economics of Information
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
Auction. Definition An auction is a process of buying and selling goods or services by offering them up for bid, taking bids, and then selling the item.
Introduction to Game Theory
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.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
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.
Project 2 Introduction. Auctions Common way to sell Different types: - First-price sealed-bid - Second-price sealed-bid - English (open outcry) - Dutch.
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
Auctions and dynamic pricing. When is the auction mechanism useful? We do not know the true value of the good or service on offer We do not know the true.
Auctions Hal R. Varian. Auctions Auctions are very useful mean of price discovery eBay: everyone’s favorite example DoveBid: high value asset sales at.
Session 4 Pricing Strategy Managerial Economics Professor Changqi Wu.
Managerial Economics & Business Strategy
and Lecture Notes in Game Theory1 Game Theory Applications: Lecture Notes Course Website u Galina.
This Week’s Topics  Review Class Concepts -Sequential Games -Simultaneous Games -Bertrand Trap -Auctions  Review Homework  Practice Problems.
This Week’s Topics  Review Class Concepts -Auctions, continued -Repeated Games -Bertrand Trap & Anti-Trust -Auctions.
Lecture 3A Dominance This lecture shows how the strategic form can be used to solve games using the dominance principle.
Chapter 19 Equivalence Types of Auctions Strategic Equivalence
Strategic Demand Reduction in homogenous multiunit auctions (where bidders may be interested in more than one unit)
Introduction to Auctions David M. Pennock. Auctions: yesterday Going once, … going twice,...
©2003, Zoran Despotovic, EPFL-I&C, Laboratoire de systèmes d'informations répartis Double Auctioning in a P2P environment (an attempt) Zoran Despotovic.
© 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.
Auction and Markets Professor Robert A. Miller January 2010 Teaching assistant:Hao Xue
Trade and Investment Strategy Professor Robert A. Miller.
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.
Auctions and Bidding. 2 Auction Theory Auction theory is important for practical reason empirical reason –testing-ground for economic theory, especially.
4. The Theories and the Real World. Strategic Behavior in Business and Econ Outline 1. Introduction 2. Individual Decision Making 3. Basic Topics in Game.
Auctions Shyam Sunder, Yale University Kozminski Academy Warsaw, June 22, 2013.
1 Risk and Information Chapter Chapter Fifteen Overview 1.Introduction: Amazon.com 2.Describing Risky Outcome – Basic Tools Lotteries and Probabilities.
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.
Auctions Great Lakes Institute of Management, Chennai March 4, 2012.
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.
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.
Bayesian games and their use in auctions
Tuomas Sandholm Computer Science Department Carnegie Mellon University
CPS Bayesian games and their use in auctions
Presentation transcript:

Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason for studying auctions is that the value of goods exchanged each year by auction is huge. We describe the main kinds of auctions, define strategic and compare the outcomes from using different types. Read Chapters 19 and 20 of Strategic Play. Lecture 1 on Auctions Optimal Bidding

Auctions Auctions are widely used by companies, private individuals and government agencies to buy and sell commodities. They are also used in competitive contracting between an (auctioneer) firm and other (bidder) firms up or down the supply chain to reach trading agreements. Merger and acquisitions often have an auction flavor about them. To begin our discussion we compare two sealed bid auctions, where there are two bidders with known valuations of 2 and 4 respectively.

First price sealed bid auction In a first price sealed auction, players simultaneously submit their bids, the highest bidder wins the auction, and pays what she bid for the item. Highway contracts typically follow this form. For example, if the valuation 4 player bids 5 and the valuation 2 player bids 1, then the former wins the auction, pays 5 and makes a net loss of 1.

Dominance for the row player The column player does not have a dominant strategy. There is a dominant strategy for the row player to bid 1. By iterative dominance the column player bids 2.

Iterative dominance in a first price auction The column player does not have a dominant strategy. There is a dominant strategy for the row player to bid 1. By iterative dominance the column player bids 2.

Second price sealed bid auction In a second priced sealed bid auction, players simultaneously submit their bids, the highest bidder wins the auction, and pays the second highest bid. This is similar to Ebay, although Ebay is not sealed bid. For example, if the valuation 4 player bids 5 and the valuation 2 player bids 1, then the former wins the auction, pays 1 and makes a net profit of 3.

Dominance in a second price auction The row player has a dominant strategy of bidding 2. The column player has a dominant strategy of bidding 4. Thus both players have a dominant strategy of bidding their (known) valuation.

Comparing auction mechanisms Comparing the two auctions, the bidder place different bids but the outcome is the same, the column player paying 2 for the item. How robust is this result, that the form of the auction does not really matter? 1. Do people know their own valuations? 2. If not, are the valuations related? 3. What do bidders know about the valuations of their rivals? 4. Is everyone risk neutral? 5. How many items are up for sale, and how many units is each player bidding on? 6. Is collusion an issue?

Bidding strategies Recall that a strategy is a complete description of instructions to be played throughout the game, and that the strategic form of a game is the set of alternative strategies to each player and their corresponding expected payoffs from following them. Two games are strategically equivalent if they share the same strategic form. In strategically equivalent auctions, the set of bidding strategies that each potential bidders receive, and the mapping to the bidder’s payoffs, are the same.

Descending auctions are strategically equivalent to first-price auctions During the course of a descending auction no information is received by bidders. Each bidder sets his reservation price before the auction, and submits a market order to buy if and when the limit auctioneer's limit order to sell falls to that point. Dutch auctions and first price sealed bid auctions share strategic form, and hence yield the same realized payoffs if the initial valuation draws are the same. Rule 1: Pick the same reservation price in Dutch auction that you would submit in a first price auction

English auction In an English auction bidders compete against each other by successively raising the price at which they are willing to pay for the auctioned object. The bidding stops when nobody is willing to raise the price any further, and the item is sold to the person who has bid the highest price, at that price.

Second-price versus ascending auctions When there are only 2 bidders, an ascending auction mechanism is strategically equivalent to the second price sealed bid auction (because no information is received during the auction). More generally, both auctions are (almost) strategically equivalent if all bidders have independently distributed valuations (because the information conveyed by the other bidders has no effect on a bidder’s valuation). In common value auctions the 3 mechanisms are not strategically equivalent if there are more than 2 players. Rule 2: If there are only two bidders, or if valuations are independently distributed, choose the same reservation price in English, Japanese and second price auctions.

Bidding in a second-price auction If you know your own valuation, there is a general result about how to bid in a second price sealed bid auction, or where to stop bidding in an ascending auction. Bidding should not depend on what you know about the valuations of the other players, nor on what they know about their own valuations. It is a dominant strategy to bid your own valuation. A corollary of this result is that if every bidder knows his own valuation, then the object will be sold for the second highest valuation. Rule 3 : In a second price sealed bid auction, bid your valuation if you know it.

Proving the third rule Suppose you bid above your valuation, win the auction, and the second highest bid also exceeds your valuation. In this case you make a loss. If you had bid your valuation then you would not have won the auction in this case. In every other case your winnings would have been identical. Therefore bidding your valuation dominates bidding above it. Suppose you bid below your valuation, and the winning bidder places a bid between your bid and your valuation. If you had bid your valuation, you would have won the auction and profited. In every other case your winnings would have been identical. Therefore bidding your valuation dominates bidding below it. The proof is completed by combining the two parts.