
Twenty Lectures on Algorithmic Game Theory by Tim Roughgarden – A Foundational Computer Science and Economics Textbook
Inclusive of all applicable taxes. FREE shipping on all orders.
Available Offers
- 🚚Free Delivery — Free shipping on all orders
- 💵Cash on Delivery — Pay when your order arrives
- ↩️15-Day Easy Returns — Hassle-free return policy
- 🔒Cash on Delivery — Pay safely when your order arrives
Check Delivery
Product Description
Introduction
Algorithmic game theory sits at the fascinating crossroads of computer science and economics, offering powerful tools to understand and design systems where multiple self-interested agents interact. In an era of digital marketplaces, online auctions, and complex networks, this field has become indispensable. Tim Roughgarden's Twenty Lectures on Algorithmic Game Theory distills the essence of this dynamic discipline into a clear, structured, and highly accessible volume. Published by Cambridge University Press, this hardcover edition is an essential addition to the library of any serious student, researcher, or professional in India who wants to grasp the principles governing modern computational economics.
Book Overview
This book is not a mere collection of essays; it is a carefully curated journey through the core ideas that define algorithmic game theory today. Born from the author's celebrated Stanford University course, it presents twenty self-contained lectures that progress logically from fundamental concepts to advanced applications. Each lecture is designed to be digestible in one sitting, making the material ideal for both classroom use and self-study. The book bridges theory and practice by including compelling case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management—topics that resonate deeply with the Indian tech and policy landscape.
Key Highlights
- Stanford-Grade Curriculum: Based on a world-renowned course, ensuring academic rigor and clarity.
- Self-Contained Lectures: Each chapter functions as a standalone module, perfect for flexible learning.
- Real-World Case Studies: Explores online advertising, spectrum auctions, kidney exchange, and network management.
- Rigorous Yet Accessible: Balances mathematical depth with intuitive explanations suitable for newcomers.
- Comprehensive Coverage: Spans mechanism design, price of anarchy, auctions, and more.
- Premium Hardcover: Durable binding for years of reference and study.
Inside the Book
The book opens with foundational concepts from game theory and computer science, then systematically builds up to sophisticated topics. Readers will explore the design of incentive-compatible mechanisms, the analysis of equilibria in networks, and the algorithmic challenges of allocating scarce resources. The lectures are enriched with exercises, illustrations, and pointers to further reading. The case studies are particularly valuable: they show how theory translates into real systems, from Google's ad auctions to India's upcoming 5G spectrum allocation mechanisms. The writing style is engaging and avoids unnecessary jargon, making complex ideas feel natural.
Key Topics
- Mechanism design and the Vickrey-Clarke-Groves (VCG) mechanism
- Price of anarchy and efficiency of equilibria
- Auction theory: sponsored search, combinatorial auctions, and spectrum sales
- Selfish routing and network congestion games
- Kidney exchange and market design
- Social choice, voting, and computational hardness
- Revenue maximisation versus social welfare
- Learning in games and no-regret dynamics
Reader Benefits
By investing in this book, you gain a structured understanding of a field that is shaping the future of digital economies. You will be able to analyse why online platforms work the way they do, design better algorithms for multi-agent systems, and appreciate the economic forces behind technologies like ride-sharing, e-commerce, and cloud computing. For Indian students preparing for competitive exams or research, this book provides a solid foundation that is rare to find in a single volume. Professionals in data science, software engineering, or policy will find the case studies directly applicable to their work.
Learning Outcomes
- Understand the fundamental models of strategic interaction in computational settings.
- Design mechanisms that align individual incentives with collective welfare.
- Analyse the efficiency loss due to selfish behaviour using the price of anarchy.
- Apply auction theory to real-world scenarios like online advertising and spectrum allocation.
- Evaluate market design problems such as kidney exchange and resource allocation.
- Recognise the computational challenges in game-theoretic problems.
Who Should Read
This book is ideal for undergraduate and postgraduate students in computer science, economics, or mathematics who want a rigorous introduction to algorithmic game theory. It is also highly recommended for researchers entering the field, software engineers working on multi-agent systems, data scientists dealing with auction or pricing problems, and policy analysts involved in spectrum or market regulation. The material assumes some familiarity with algorithms and basic probability but is designed to be welcoming to motivated learners from diverse backgrounds.
About the Author
Tim Roughgarden is a Professor of Computer Science at Columbia University, widely recognised for his pioneering contributions to algorithmic game theory. He has received numerous awards, including the ACM Grace Murray Hopper Award and the Gödel Prize. His teaching is legendary, and this book captures his ability to make complex topics clear and exciting. He is also the author of several other influential texts and is a sought-after speaker at conferences worldwide.
About the Publisher
Cambridge University Press is one of the oldest and most respected academic publishers in the world, with a history spanning over 400 years. Known for its commitment to scholarly excellence, Cambridge University Press ensures that every title meets the highest standards of accuracy, clarity, and production quality. This hardcover edition reflects that legacy, making it a reliable and lasting resource for Indian readers.
Conclusion
Twenty Lectures on Algorithmic Game Theory is more than a textbook—it is a gateway to understanding the algorithms that power our interconnected world. Whether you are a student aiming to excel in your studies, a researcher seeking a solid reference, or a professional navigating the complexities of digital markets, this book delivers exceptional value. With its rigorous yet friendly approach, real-world case studies, and the authority of Cambridge University Press, it deserves a prominent place on your bookshelf. Order your copy from Bookshops.in today and take the first step into the fascinating intersection of computation and economics.
Quick Summary
Twenty Lectures on Algorithmic Game Theory by Tim Roughgarden is a comprehensive and accessible introduction to the vibrant field where computer science and economics converge. Based on the author's popular Stanford University course, this book distills complex concepts into twenty clear, lecture-style chapters. Readers will explore core topics such as mechanism design, auction theory, the price of anarchy, selfish routing, and equilibrium analysis, all with a focus on algorithmic and computational perspectives. The book is ideal for graduate students, researchers, and professionals in computer science, economics, and related fields who want to understand how strategic interactions shape modern digital systems like online advertising, network routing, and resource allocation. Tim Roughgarden's engaging writing style and practical examples make even advanced ideas accessible. By purchasing from Bookshops.in, Indian readers receive a genuine, high-quality hardcover edition at a competitive price, with reliable delivery across the country. Whether you are preparing for research, exams, or a career in tech, this book provides a solid foundation in one of the most impactful interdisciplinary areas of modern science.
Book Highlights
Book Specifications
| ISBN-13 | 9781107172661 |
| ISBN-10 | 1107172667 |
| Publisher | Cambridge University Press |
| Language | English |
| Dimensions | 15.88 x 2.54 x 22.86 cm |
| Weight | 630 g |
| Country | India |
| Category | Computer Science › Artificial Intelligence |
| Genre | Non-fiction |
| Original Language | English |
Frequently Asked Questions
What is algorithmic game theory?
Who is the author of this book?
Is this book suitable for beginners?
What topics are covered in the book?
How is this book different from other game theory books?
Does the book include exercises?
What is the price in India?
Is this book available in hardcover?
Can I use this book for self-study?
Does the book cover modern applications?
Is there a digital version available?
What is the rating of this book?
Which publisher released this book?
Why should I buy from Bookshops.in?
Readers Also Search For
Customers Also Bought

Computer Science
Spring 2.5 Aspect Oriented Programming (English, Massimiliano Dess� | Massimiliano Dessi)

Computer Science
Asterisk 1.4 - the Professional's Guide (English, Colman Carpenter | David Duffett | Nik Middleton)

Computer Science
Advances In Natural Language Processing: 4th International Conference, Estal 2004, Alicante, Spain, October 20-22, 2004. Proceedings: 3230 (Lecture Notes in Computer Science)

Computer Science
Multimedia, Communication and Computing Application: Proceedings of the 2014 International Conference on Multimedia, Communication and Computing ... 2014), Xiamen, China, October 16-17, 2014

Computer Science
Cases on Database Technologies and Applications (Cases on Information Technology Series)

Computer Science
ASP.Net 3.5 Social Networking (English, Andrew Siemer)
Related Products
View All
Computer Science
Spring 2.5 Aspect Oriented Programming (English, Massimiliano Dess� | Massimiliano Dessi)

Computer Science
Asterisk 1.4 - the Professional's Guide (English, Colman Carpenter | David Duffett | Nik Middleton)

Computer Science
Advances In Natural Language Processing: 4th International Conference, Estal 2004, Alicante, Spain, October 20-22, 2004. Proceedings: 3230 (Lecture Notes in Computer Science)

Computer Science
Multimedia, Communication and Computing Application: Proceedings of the 2014 International Conference on Multimedia, Communication and Computing ... 2014), Xiamen, China, October 16-17, 2014

Computer Science
Cases on Database Technologies and Applications (Cases on Information Technology Series)

Computer Science
