Revenue Equivalence and Mechanism Design

Similar documents
Multiunit Auctions: Package Bidding October 24, Multiunit Auctions: Package Bidding

Mechanism Design and Auctions

Bayesian games and their use in auctions. Vincent Conitzer

We examine the impact of risk aversion on bidding behavior in first-price auctions.

Problem Set 3: Suggested Solutions

Microeconomic Theory III Spring 2009

Auction Theory: Some Basics

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University

Notes on Auctions. Theorem 1 In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy.

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012

Auctioning one item. Tuomas Sandholm Computer Science Department Carnegie Mellon University

Revenue Equivalence and Income Taxation

Today. Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction

Recap First-Price Revenue Equivalence Optimal Auctions. Auction Theory II. Lecture 19. Auction Theory II Lecture 19, Slide 1

Parkes Auction Theory 1. Auction Theory. Jacomo Corbo. School of Engineering and Applied Science, Harvard University

CSV 886 Social Economic and Information Networks. Lecture 4: Auctions, Matching Markets. R Ravi

Strategy -1- Strategic equilibrium in auctions

Auctions. Agenda. Definition. Syllabus: Mansfield, chapter 15 Jehle, chapter 9

Auctions. Episode 8. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto

Auctions. Economics Auction Theory. Instructor: Songzi Du. Simon Fraser University. November 17, 2016

Games of Incomplete Information ( 資訊不全賽局 ) Games of Incomplete Information

Optimal Auctions. Game Theory Course: Jackson, Leyton-Brown & Shoham

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University

ECO 426 (Market Design) - Lecture 11

Auctions. N i k o l a o s L i o n i s U n i v e r s i t y O f A t h e n s. ( R e v i s e d : J a n u a r y )

ECO 426 (Market Design) - Lecture 9

Subjects: What is an auction? Auction formats. True values & known values. Relationships between auction formats

Social Network Analysis

All Equilibrium Revenues in Buy Price Auctions

Simultaneous Multi-round Auctions

The Clock-Proxy Auction: A Practical Combinatorial Auction Design

Mechanism Design and Auctions

LECTURE 7: SINGLE OBJECT AUCTIONS. 9/11/2010 EC3322 Autumn

Matching Markets and Google s Sponsored Search

Mechanism Design and Auctions

Algorithmic Game Theory

Auction is a commonly used way of allocating indivisible

KIER DISCUSSION PAPER SERIES

Auction Theory. Philip Selin. U.U.D.M. Project Report 2016:27. Department of Mathematics Uppsala University

Game Theory and Auctions

by open ascending bid ("English") auction Auctioneer raises asking price until all but one bidder drops out

Auction types. All Pay Auction: Everyone writes down a bid in secret. The person with the highest bid wins. Everyone pays.

Sequential-move games with Nature s moves.

Auctions. MSc Finance Theory of Finance 1: Financial Topics Autumn Arup Daripa Birkbeck College. The background

CUR 412: Game Theory and its Applications, Lecture 4

Parkes Auction Theory 1. Auction Theory. David C. Parkes. Division of Engineering and Applied Science, Harvard University

Day 3. Myerson: What s Optimal

ECON20710 Lecture Auction as a Bayesian Game

Strategy -1- Strategy

Game Theory Lecture #16

1 Theory of Auctions. 1.1 Independent Private Value Auctions

Lecture #6: Auctions: Theory and Applications. Prof. Dr. Sven Seuken

Auctions: Types and Equilibriums

Games with Private Information 資訊不透明賽局

Consider the following (true) preference orderings of 4 agents on 4 candidates.

Topics in Informational Economics 2 Games with Private Information and Selling Mechanisms

Bayesian Nash Equilibrium

CUR 412: Game Theory and its Applications, Lecture 4

Experiments on Auctions

ECO 426 (Market Design) - Lecture 8

Ad Auctions October 8, Ad Auctions October 8, 2010

Noncooperative Market Games in Normal Form

Attracting Intra-marginal Traders across Multiple Markets

EC476 Contracts and Organizations, Part III: Lecture 3

Recalling that private values are a special case of the Milgrom-Weber setup, we ve now found that

Auctions. Book Pages Auction. Auction types. Rules to Auctions

II-5. Intermediaries. Outline. Introduction. SponSearch. Introduction. II-5. Intermediaries. Introduction. SponSearch. II-5.

EconS Games with Incomplete Information II and Auction Theory

Auctions Introduction

Auctions. Microeconomics II. Auction Formats. Auction Formats. Many economic transactions are conducted through auctions treasury bills.

Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 2017

Auction Theory Lecture Note, David McAdams, Fall Bilateral Trade

Countering the Winner s Curse: Optimal Auction Design in a Common Value Model

Notes for Section: Week 7

COMP/MATH 553 Algorithmic Game Theory Lecture 2: Mechanism Design Basics. Sep 8, Yang Cai

Parkes Mechanism Design 1. Mechanism Design I. David C. Parkes. Division of Engineering and Applied Science, Harvard University

1 Intro to game theory

Microeconomics Comprehensive Exam

Introduction to Multi-Agent Systems. Yoav Shoham (Written with Trond Grenager)

Insurance, Adverse Selection and Moral Hazard

Game Theory. Jiang, Bo ( 江波 )

Elements of auction theory. This material is not part of the course, but is included here for those who are interested

Profit Sharing Auction

Introduction to mechanism design. Lirong Xia

Up till now, we ve mostly been analyzing auctions under the following assumptions:

Signaling in an English Auction: Ex ante versus Interim Analysis

CS364A: Algorithmic Game Theory Lecture #3: Myerson s Lemma

A simulation study of two combinatorial auctions

Preference Networks in Matching Markets

Independent Private Value Auctions

Auctions. Market Design. University of Notre Dame. Market Design (ND) Auctions 1 / 61

Core Deviation Minimizing Auctions

ECON Microeconomics II IRYNA DUDNYK. Auctions.

Mechanism design with correlated distributions. Michael Albert and Vincent Conitzer and

BIDDING STRATEGIES IN PROCUREMENT-RELATED TWO-STAGE AUCTIONS. Yaroslav Kheilyk. Kyiv School of Economics

Negotiation Master Course NEGOTIATION 9/12/09

Auctions in the wild: Bidding with securities. Abhay Aneja & Laura Boudreau PHDBA 279B 1/30/14

Applicant Auction Conference

Econ 101A Final exam May 14, 2013.

Transcription:

Equivalence and Design Daniel R. 1 1 Department of Economics University of Maryland, College Park. September 2017 / Econ415

IPV, Total Surplus

Background the mechanism designer The fact that there are many potential auction formats raises an immediate question, is one better than the other? It obviously depends on what the goals of the auctioneer are. Two obvious goals are maximizing overall efficiency (getting the objects in the hands of the bidders who value them the most) and maximizing expected revenue. One can think of the role of the mechanism designer as to select the best auction so as to achieve the goals of her principal. If we can predict the play of bidders in the various auctions (solution concept appropriate?) then we can use this analysis as a guide. Other goals equity, antitrust interests, national security.

Outcome related results efficiency Note that, in many of our auctions, monotonic bids imply that we can predict who will win. In IPV auctions, if bids are monotonic in type then highest value bidder will win. In IPV auctions, if highest value bidder wins, then outcome automatically is efficient (why?)

Outcome related results Vickrey (1961) and later Myerson (1981) showed a surprising but powerful related result with respect to revenue. In IPV auctions, total expected revenue raised in an auction depends only on two things, how the good is allocated and the payoff of the lowest type of bidder. Thus, Equivalence: Every auction type that generates the same bidder and yields zero payoff to the lowest type of bidder yields the same expected revenue. Since SPA, FPA, ascending and descending clock auctions all yield zero payoff to the lowest type and all result in the highest type bidder obtaining the object (in the synmetric IPV environment), they all generate the same expected revenue. What happens if the auction has a reserve price?

Affiliated, non-private values: Linkage Principal The Equivalence result does not hold outside of the risk neutral IPV model. A result by Milgrom and Weber (1982) showed that with affiliated and non-private values, between two auction mechanisms, the one auction that more strongly links the price paid to more private information held by bidders in the auction, the higher the expected revenue. Since in SPA, the final price depends not only on the information of the winner but also the second highest bidder, with affiliated non-private values, SPA generally will raise more expected revenue than FPA. Since ascending bid auctions also potential incorporate information of all other (losing) bidders, ascending bid auctions raise more money than SPAs. FPA and descending clock auctions?

IPV auctions with Risk Averse bidders Observe that even if expected payments of bidders were the same, actual payments of bidders in auctions (say FPA vs. SPA) can differ. Consider a bidder who is concerned about randomness. A SPA imposes two types of randomness will the bidder win, and how much the bidder pays. A FPA removes one of those types of uncertainty. A consequence is that risk averse bidders in FPAs will tend to be willing to bid more aggressively in FPAs than in SPAs.

Multi-unit auctions In one sense, the Equivalence Theorem stills holds (with IPV environment). Auctions that generate the same allocation will generate the same expected revenue. A problem posed by multi-unit auctions is that we typically do not yet understand what are equilibria in these complicated mechanisms (excepting Vickrey auctions). Thus, on revenue grounds, it is not known which auction format is the best.

A Narrative We can conceive of an auction specialist hired by a principal (government, seller, agency) to design a mechanism to sell one or more objects. FCC spectrum auctions are a natural case study, but also electrical power auctions, carbon emission auctions, internet auctions etc. The principal ideally communicates to the specialist the criteria that matters most. The specialist (mechanism designer) then designs a mechanism to best achieve these goals.

Direct s Analytically, a classic way to achieve this is via direct mechanisms and the Revelation Principal. A direct mechanism is itself an auction game where the players strategies are simply to report their types to the auctioneer. See SPA, Vickrey auction, what does type mean? It is important to note that in a context of private information, there is no direct way to ensure bidders report their true type. Part of the goal of the Designer, is to design a mechanism where bidders own incentives are to report their true types. In general, though, the need to induce agents to tell the truth limits the scope of outcomes the mechanism designer can achieve.

Revelation Principal Why such an artificial approach? The Revelation Principal is the guiding principle underlying it. The Revelation Principle states that if an outcome in an auction can be implemented as a Bayesian Nash Equilibrium of some auction game, then there is a direct mechanism which implements the same outcome via truthful strategies as a BNE. The advantage of this result is that we can narrow down our search over mechanisms to only direct mechanisms for a lot of purposes. Much of the theoretical work in auction theory takes this approach. Note parallel to proxy bidder idea.

Remaining Problems The Revelation Principle is deceptively simple particularly in implementing the MD in practice. As we have seen, for more general auction settings, we do not know what equilibrium outcomes might look like (multi-unit, eg.) Additionally, the standard model avoids some other basic questions (a partial list): How do we determine what are the objects to sell? (Spectrum license design, power contract length etc.) How can we determine who are the bidders (bidder qualifications, entry, merger etc.) What about other criteria (anti-trust, equity etc.) In the FCC spectrum auction case study we examine some of these issues.