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

2 - Mechanism Design Basics

Published online by Cambridge University Press:  05 August 2016

Tim Roughgarden
Affiliation:
Stanford University, California
Get access

Summary

With this lecture we begin our formal study of mechanism design, the science of rule-making. This lecture introduces an important and canonical example of a mechanism design problem, the design of single-item auctions, and develops some mechanism design basics in this relatively simple setting. Later lectures extend the lessons learned to more complex applications.

Section 2.1 defines a model of single-item auctions, including the quasilinear utility model for bidders. After quickly formalizing sealedbid auctions in Section 2.2 and mentioning first-price auctions in Section 2.3, in Section 2.4 we introduce second-price (a.k.a. Vickrey) auctions and establish their basic properties. Section 2.5 formalizes what we want in an auction: strong incentive guarantees, strong performance guarantees, and computational efficiency. Section 2.6 presents a case study on sponsored search auctions for selling online advertising, a “killer application” of auction theory.

Single-Item Auctions

We start our discussion of mechanism design with single-item auctions. Recall our overarching goal in this part of the course.

Course Goal 1 Understand how to design systems with strategic participants that have good performance guarantees.

Consider a seller with a single item, such as a slightly antiquated smartphone. This is the setup in a typical eBay auction, for example. There is some number n of (strategic!) bidders who are potentially interested in buying the item.

We want to reason about bidder behavior in various auction formats. To do this, we need a model of what a bidder wants. The first key assumption is that each bidder i has a nonnegative valuation vi—her maximum willingness-to-pay for the item being sold. Thus bidder i wants to acquire the item as cheaply as possible, provided the selling price is at most vi. Another important assumption is that this valuation is private, meaning it is unknown to the seller and to the other bidders.

Our bidder utility model, called the quasilinear utility model, is the following. If a bidder i loses an auction, her utility is 0. If the bidder wins at a price p, her utility is vi - p. This is arguably the simplest natural utility model, and it is the one we focus on in these lectures.

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.

  • Mechanism Design Basics
  • 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.003
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.

  • Mechanism Design Basics
  • 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.003
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.

  • Mechanism Design Basics
  • 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.003
Available formats
×