Algorithmic Game Theory
Price of anarchy, computational equilibria, and online auctions.
Algorithmic Game Theory. Price of anarchy, computational equilibria, and online auctions.
Foundations and canonical references
The standard treatments of algorithmic game theory approach the subject from complementary angles. Nisan, Algorithmic Game Theory (2007) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to. Roughgarden, Twenty Lectures on Algorithmic Game Theory (2016) gives a parallel, more proof-oriented exposition of the same material and is widely used as a graduate text.
Open methodological questions for algorithmic game theory include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.
Prerequisites
Sources
- textbook · primary · 2007Algorithmic Game Theorynisan-2007, roughgarden-2007, tardos-2007, vazirani-2007
- textbook · primary · 2016Twenty Lectures on Algorithmic Game Theoryroughgarden-2016
In context
Where this topic sits in the prerequisite graph. Click any node to jump.
Review this topic
This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.