Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-27T07:25:20.951Z Has data issue: false hasContentIssue false

5 - Revenue-Maximizing Auctions

Published online by Cambridge University Press:  05 August 2016

Tim Roughgarden
Affiliation:
Stanford University, California
Get access

Summary

Lectures 2-4 focused on the design of mechanisms that maximize, exactly or approximately, the social welfare of the outcome. Revenue is generated in such mechanisms only as a side effect, a necessary evil to incentivize agents to report truthfully their private information. This lecture studies mechanisms that are designed to raise as much revenue as possible, and characterizes the expected revenue-maximizing mechanism with respect to a prior distribution over agents’ valuations.

Section 5.1 explains why reasoning about revenue maximization is harder than welfare maximization, and introduces Bayesian envi-ronments. Section 5.2 is the heart of this lecture, and it characterizes expected revenue-maximizing mechanisms as “virtual welfare maxi-mizers.” Section 5.3 describes how this theory was used to boost sponsored search revenue at Yahoo. Section 5.4 proves a technical lemma needed for the characterization in Section 5.2.

The Challenge of Revenue Maximization

Spoiled by Social Welfare Maximization

There are several reasons to begin the study of mechanism design with the objective of maximizing social welfare. The first reason is that this objective is relevant to many real-world scenarios. For instance, in government auctions (e.g., to sell wireless spectrum; see Lecture 8), the primary objective is welfare maximization. Revenue is also a consideration in such auctions, but it is usually not the first-order objective. Also, in competitive markets, a rule of thumb is that a seller should focus on welfare maximization, since otherwise a competitor will (thereby stealing their customers).

The second reason to start with social welfare maximization is pedagogical: social welfare is special. In every single-parameter environment, there is a DSIC mechanism that, for every profile of private valuations, assuming truthful bids, computes the welfare-maximizing outcome (cf., Exercise 4.1). Such a mechanism optimizes the social welfare as effectively as if all of the private information was known in advance—the DSIC constraint is satisfied for free. This amazingly strong performance guarantee, called an “ex post” guarantee, cannot generally be achieved for other objective functions.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2016

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Revenue-Maximizing Auctions
  • Tim Roughgarden, Stanford University, California
  • Book: Twenty Lectures on Algorithmic Game Theory
  • Online publication: 05 August 2016
  • Chapter DOI: https://doi.org/10.1017/CBO9781316779309.006
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Revenue-Maximizing Auctions
  • Tim Roughgarden, Stanford University, California
  • Book: Twenty Lectures on Algorithmic Game Theory
  • Online publication: 05 August 2016
  • Chapter DOI: https://doi.org/10.1017/CBO9781316779309.006
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Revenue-Maximizing Auctions
  • Tim Roughgarden, Stanford University, California
  • Book: Twenty Lectures on Algorithmic Game Theory
  • Online publication: 05 August 2016
  • Chapter DOI: https://doi.org/10.1017/CBO9781316779309.006
Available formats
×