Algorithmic Game Theory
by Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V. Vazirani Β· Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V. Vazirani
Edited graduate-level volume by leading researchers covering equilibrium computation, mechanism design, price of anarchy, auctions, and network games. Readers learn how computational complexity and incentive analysis combine to explain strategic behavior in markets and networked systems.
This link may earn us a small commission at no extra cost to you. Affiliate disclosure
More resources on Algorithmic Game Theory
gametheory.net
gametheory.net is a curated online resource for game theory and algorithmic game theory, featuring lecture notes, tutorials, problem sets, and curated links to key papers and tools.
brilliant.org
Brilliant.org is an online, interactive learning platform offering problem-based courses in math and computer science, including topics in automata theory, computation, and discrete mathematics, with guided lessons and practice problems.
Twenty Lectures on Algorithmic Game Theory
Compact lecture notes from Roughgarden's Stanford course covering mechanism design, auctions, spectrum auctions, price of anarchy in routing and games, and the complexity of computing equilibria. Readers learn to analyze incentives and inefficiency in systems with self-interested participants.