Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-dfsvx Total loading time: 0 Render date: 2024-04-26T21:07:06.441Z Has data issue: false hasContentIssue false

1 - Introduction and Examples

Published online by Cambridge University Press:  05 August 2016

Tim Roughgarden
Affiliation:
Stanford University, California
HTML view is not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Summary

This book has three parts, each with its own overarching goal. Lectures 2–10 develop tools for designing systems with strategic participants that have good performance guarantees. The goal of Lectures 11–15 is to understand when selfish behavior is largely benign. Lectures 16–20 study if and how strategic players reach an equilibrium of a game. The three sections of this lecture offer motivating examples for the three parts of the book.

The Science of Rule-Making

We begin with a cautionary tale. In 2012, the Olympics were held in London. One of the biggest scandals of the event concerned, of all sports, women's badminton. The scandal did not involve any failed drug tests, but rather a failed tournament design that did not carefully consider incentives.

The tournament design used is familiar from World Cup soccer. There are four groups (A, B, C, D) of four teams each. The tournament has two phases. In the first “round-robin” phase, each team plays the other three teams in its group, and does not play teams in other groups. The top two teams from each group advance to the second phase, while the bottom two teams from each group are eliminated. In the second phase, the remaining eight teams play a standard “knockout” tournament. There are four quarterfinals, with the losers eliminated, followed by two semifinals, with the losers playing an extra match to decide the bronze medal. The winner of the final gets the gold medal, the loser the silver.

The incentives of participants and of the Olympic Committee and fans are not necessarily aligned in such a tournament. What does a team want? To get as prestigious a medal as possible. What does the Olympic Committee want? They didn't seem to think carefully about this question, but in hindsight it is clear that they wanted every team to try their best to win every match. Why would a team ever want to lose a match? Indeed, in the knockout phase of the tournament, where losing leads to instant elimination, it is clear that winning is always better than losing.

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

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.

  • Introduction and Examples
  • 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.002
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.

  • Introduction and Examples
  • 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.002
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.

  • Introduction and Examples
  • 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.002
Available formats
×