Algorithmic Game Theory (Google eBook)

Front Cover
Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V. Vazirani
Cambridge University Press, Sep 24, 2007 - Computers - 754 pages
4 Reviews
In recent years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. Algorithmic Game Theory, first published in 2007, develops the central ideas and results of this exciting area in a clear and succinct manner. More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on important game theory applications such as incentives and pricing, cost sharing, information markets and cryptography and security. This definitive work will set the tone of research for the next few years and beyond. Students, researchers, and practitioners alike need to learn more about these fascinating theoretical developments and their widespread practical application.
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Part II Algorithmic Mechanism Design
207
Part III Quantifying the Inefficiency of Equilibria
441
Part IV Additional Topics
569

Common terms and phrases

Popular passages

Page xxi - Department of Electrical and Computer Engineering, and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign...
Page i - Assistant Professor in the College of Computing at the Georgia Institute of Technology and Adjunct Professor in the School of Psychology.

References to this book

All Book Search results »

About the author (2007)

Tim Roughgarden is an Assistant Professor in the Department of Computer Science at Stanford University.

Vijay Vazirani got his Bachelor's degree in Computer Science from MIT in 1979 and his PhD from the University of California at Berkeley in 1983. The central theme in his research career has been the design of efficient algorithms. Additionally, he has also worked on complexity theory, cryptography, coding theory and game theory. In 2001 he published what is widely regarded as the definitive book on Approximation Algorithms; this book has been translated into Japanese, Polish and French. He is a Fellow of the ACM.

Bibliographic information