Incentive Auctions Peter Cramton* Professor of Economics, University of Maryland Chairman, Market Design Inc. 23 May 2011 (updated 29 May 2011) * Special.

Slides:



Advertisements
Similar presentations
Numbers Treasure Hunt Following each question, click on the answer. If correct, the next page will load with a graphic first – these can be used to check.
Advertisements

AP STUDY SESSION 2.
1
Chapter 3 Demand and Behavior in Markets. Copyright © 2001 Addison Wesley LongmanSlide 3- 2 Figure 3.1 Optimal Consumption Bundle.
© 2008 Pearson Addison Wesley. All rights reserved Chapter Seven Costs.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Supply and Demand The goal of this chapter is to explain how supply and demand really work. What determines the price of a good or service? How does the.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Author: Julia Richards and R. Scott Hawley
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
Objectives: Generate and describe sequences. Vocabulary:
UNITED NATIONS Shipment Details Report – January 2006.
RXQ Customer Enrollment Using a Registration Agent (RA) Process Flow Diagram (Move-In) Customer Supplier Customer authorizes Enrollment ( )
David Burdett May 11, 2004 Package Binding for WS CDL.
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Properties of Real Numbers CommutativeAssociativeDistributive Identity + × Inverse + ×
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt BlendsDigraphsShort.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt FactorsFactors.
1 Click here to End Presentation Software: Installation and Updates Internet Download CD release NACIS Updates.
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
What is economics?.
Break Time Remaining 10:00.
Turing Machines.
Table 12.1: Cash Flows to a Cash and Carry Trading Strategy.
PP Test Review Sections 6-1 to 6-6
The Weighted Proportional Resource Allocation Milan Vojnović Microsoft Research Joint work with Thành Nguyen Microsoft Research Asia, Beijing, April, 2011.
1 The Blue Café by Chris Rea My world is miles of endless roads.
EU market situation for eggs and poultry Management Committee 20 October 2011.
Bellwork Do the following problem on a ½ sheet of paper and turn in.
2 |SharePoint Saturday New York City
Exarte Bezoek aan de Mediacampus Bachelor in de grafische en digitale media April 2014.
BEEF & VEAL MARKET SITUATION "Single CMO" Management Committee 18 April 2013.
VOORBLAD.
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
1 RA III - Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Buenos Aires, Argentina, 25 – 27 October 2006 Status of observing programmes in RA.
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
CONTROL VISION Set-up. Step 1 Step 2 Step 3 Step 5 Step 4.
© 2012 National Heart Foundation of Australia. Slide 2.
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt Synthetic.
Perfect Competition.
Model and Relationships 6 M 1 M M M M M M M M M M M M M M M M
1 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit.
Copyright © 2008 Pearson Addison-Wesley. All rights reserved. Chapter 10 A Monetary Intertemporal Model: Money, Prices, and Monetary Policy.
Analyzing Genes and Genomes
1 Chapter 11 APPLIED COMPETITIVE ANALYSIS Copyright ©2005 by South-Western, a division of Thomson Learning. All rights reserved.
Speak Up for Safety Dr. Susan Strauss Harassment & Bullying Consultant November 9, 2012.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Copyright © 2008 Pearson Addison-Wesley. All rights reserved. Chapter 12 Keynesian Business Cycle Theory: Sticky Wages and Prices.
Essential Cell Biology
Clock will move after 1 minute
Intracellular Compartments and Transport
PSSA Preparation.
Essential Cell Biology
Immunobiology: The Immune System in Health & Disease Sixth Edition
Physics for Scientists & Engineers, 3rd Edition
Energy Generation in Mitochondria and Chlorplasts
Select a time to count down from the clock above
Distributed Computing 9. Sorting - a lower bound on bit complexity Shmuel Zaks ©
Globalization and International Trade Lecture 8 – academic year 2014/15 Introduction to Economics Fabio Landini.
1 Decidability continued…. 2 Theorem: For a recursively enumerable language it is undecidable to determine whether is finite Proof: We will reduce the.
Incentive Auctions Peter Cramton* Professor of Economics, University of Maryland Chairman, Market Design Inc. 15 July 2011 * Special thanks to Larry Ausubel,
Incentive Auctions for Repurposing Broadcasting Spectrum Evan Kwerel Federal Communications Commission Spectrum Markets: Challenges Ahead Kellogg School.
1 Multiunit Auctions Part II Thanks to Larry Ausubel and especially to Peter Cramton for sharing their notes.
What is the best plan? Peter Cramton (with Larry Ausubel and Paul Milgrom) November 2003.
Presentation transcript:

Incentive Auctions Peter Cramton* Professor of Economics, University of Maryland Chairman, Market Design Inc. 23 May 2011 (updated 29 May 2011) * Special thanks to Larry Ausubel, Evan Kwerel, and Paul Milgrom for collaborating with me on this topic over the last dozen years. Thanks to the National Science Foundation for funding. 1

Incentive auctions High value Mobile broadband Low value Over-the-air TV broadcast Auction includes essential regulatory steps to address market failures in the secondary market for spectrum 2

Letter from 112 economists, 6 April

Motivation Year Value per MHz Value of over-the-air broadcast TV Value of mobile broadband TV signal received via cable and satellite Explosion in use of smartphones and tablets Gains from trade 4

VHF and UHF bands Lower VHFUpper VHFUHF Public Safety Current uses (TV broadcast) TV ch 2-6TV ch 7-13TV ch RA Lower VHFUpper VHFUHF Public Safety Possible future uses TV ch 2-6TV ch 7-13TV ch 14-?? RA Flexible UseFlex. Use TV ch

Voluntary approach TV broadcaster freely decides to Share with another Cease over-the-air broadcast Continue over-the- air broadcast 0 MHz3 MHz6 MHz Spectrum freed 6 For simplicity, I assume that channel sharing is only 2:1; other possibilities could also be considered, including negotiated shares with particular partners announced at qualification

Why voluntary? More likely to quickly clear spectrum – Broadcasters benefit from cooperating Lower economic cost of clearing – Spectrum given up only by broadcasters who put smallest value on over-the-air signal Market pricing for clearing – Avoids costly administrative process Efficient clearing – Clear only when value to mobile operator > value to TV broadcaster 7

Two approaches Combinatorial exchange Too complex due to repacking Reverse auction to determine supply Forward auction to determine demand Optimiza- tion gives mandatory repacking options 8 Market clearing and settlement

Mostly single channel Price discovery less important => Sealed-bid auction or descending clock – Price to cease – Price to share TV broadcaster freely decides to Share with another Cease over-the-air broadcast Continue over-the- air broadcast 0 MHz3 MHz6 MHz Spectrum freed Reverse auction to determine supply 9

MHz MHz MHz Price = $30/MHzPop P = $30 S = 48 Washington DC 10

Reverse auction to determine supply MHz3 MHz6 MHz Price = $20/MHzPop P = $20 S = 36 Washington DC 11

Reverse auction to determine supply MHz3 MHz6 MHz Price = $10/MHzPop P = $10 S = 24 Washington DC 12

Mandatory repacking S = 36 P = $20 Supply = 160 MHz 13

Forward auction to determine demand Mobile operators want large blocks of contiguous paired spectrum for LTE (4G) – One to four 2 × 5 MHz lots Complementaries strong both within and across regions Package clock auction ideal – Within region complementarities guaranteed with generic lots – Across region complementarities achieved through optimization of specific assignments 14

Package clock auction: Overview Auctioneer names prices; bidder names package – Price increased if there is excess demand – Process repeated until no excess demand Supplementary bids – Improve clock bids – Bid on other relevant packages Optimization to determine assignment/prices No exposure problem (package auction) Second pricing to encourage truthful bidding Activity rule to promote price discovery 15

Forward auction to determine demand Quantity Price P2P2 P3P3 P4P4 P5P5 P6P6 Supply P0P0 P1P1 Demand 16

Forward auction to determine demand Quantity Price Supply P* Q* 17 Demand

To Treasury To TV broadcasters Forward auction to determine demand Quantity Price Supply PDPD Q0Q0 PSPS Q* Broadcasters cannot negotiate ex post with operators, since it is the FCCs repacking that creates value; ex post trades would not benefit from repacking 18 Demand

Ways Congress can screw up Impose restrictions on which broadcasters can participate in the auction – Destroys competition in reverse auction Make repacking purely voluntary – Reverses status quoFCC can relocate stations – Creates holdout problem in reverse auction Too greedy – Impose specific requirement on government revenue share (e.g., Treasury gets 40% of revenue) 19

To Treasury To TV broadcasters Quantity Price Supply PDPD Q0Q0 PSPS Q* Not too greedy: Quantity choice left to FCC 20 Demand

Quantity Price Supply PDPD Q 40% PSPS Q* Too greedy constraint: Treasury must get at least 40% 21 Demand To Treasury To TV broadcasters Revenue share constraint causes huge social welfare loss and reduces Treasury revenues!

Ways FCC can screw up Impose restrictions on which broadcasters can participate in the auction – Destroys competition in reverse auction Make repacking purely voluntary – Reverses status quoFCC can relocate stations – Creates holdout problem in reverse auction Adopt poor auction design Fail to address competition concerns 22

Background Package Clock Auction 23

Package clock auction: Overview A package bid is an all-or-nothing bid for a portfolio of products When bidding on individual lots, a bidder is exposed to the risk of winning only some of a complementary set of products Package bidding eliminates the exposure problem by allowing bidders to bid on packages of products At the same time, package bidding can help to alleviate the demand reduction problem in which larger bidders inefficiently reduce demand in order to win spectrum at lower prices 24

Package clock auction: Overview Auctioneer names prices; bidder names package – Price increased if there is excess demand – Process repeated until no excess demand Supplementary bids – Improve clock bids – Bid on other relevant packages Optimization to determine assignment/prices No exposure problem (package auction) Second pricing to encourage truthful bidding Activity rule to promote price discovery 25

Package clock auction adopted for several recent and upcoming auctions UK 10-40GHz spectrum – February 2008, 27 rounds, £16 million UK L-band spectrum – May 2008, 33 rounds, £8.3 million UK 800MHz and 2.6GHz – First-quarter 2012 Netherlands 2.6GHz spectrum Belgium 2.6GHz spectrum Austria 2.6GHz spectrum 26

Bidder-optimal core pricing Minimize payments subject to core constraints Core = assignment and payments such that – Efficient: Value maximizing assignment – Unblocked: No subset of bidders offered seller a better deal 27

Five-bidder example with bids on {A,B} b 1 {A} = 28 b 2 {B} = 20 b 3 {AB} = 32 b 4 {A} = 14 b 5 {B} = 12 Winners Vickrey prices: p 1 = 14 p 2 = 12 28

The Core b 4 {A} = 14 b 3 {AB} = 32 b 5 {B} = 12 b 1 {A} = 28 b 2 {B} = 20 Bidder 2 Payment Bidder 1 Payment The Core Efficient outcome 29

The Core b 4 {A} = 14 b 3 {AB} = 32 b 5 {B} = 12 b 1 {A} = 28 b 2 {B} = 20 Bidder 2 Payment Bidder 1 Payment Vickrey prices Vickrey prices: How much can each winners bid be reduced (while holding others fixed)? Problem: Bidder 3 can offer seller more (32 > 26)! 30

The Core b 4 {A} = 14 b 3 {AB} = 32 b 5 {B} = 12 b 1 {A} = 28 b 2 {B} = 20 Bidder 2 Payment Bidder 1 Payment Vickrey prices Bidder-optimal core prices: Jointly reduce winning bids as much as possible (while remaining within core) Bidder-optimal core Problem: bidder- optimal core prices are not unique! 31

Unique core prices b 4 {A} = 14 b 3 {AB} = 32 b 5 {B} = 12 b 1 {A} = 28 b 2 {B} = 20 Bidder 2 Payment Bidder 1 Payment Vickrey prices Core point closest to Vickrey prices (Alternative: core point closest to linear prices) Each pays equal share above Vickrey 32

Package clock auctions: Activity rule Activity rule based on revealed preference: Bidders can only move toward packages that become better values – At time t > t, package q t has become relatively cheaper than q t (P )q t (p t – p t ) q t (p t – p t ) – Supplementary bid b(q) must be less profitable than revised package bid at t (S )b(q) b(q t ) + (q – q t ) p t 33

Properties with substitutes Bidding on most profitable package is best Clock yields competitive equilibrium with efficient assignment and supporting prices Final assignment = clock assignment 34

Properties in general Supplementary bids needed if excess supply Bidder can guarantee winning its final package by raising bid by final price of unsold lots 35