In the last few years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. 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 incentives and pricing, cost sharing, information markets and cryptography and security. Students, researchers and practitioners alike need to learn more about these fascinating theoretical developments and their widespread practical application.
Review
"The subject matter of Algorithmic Game Theory covers many of the hottest area of useful new game theory research, introducing deep new problems, techniques, and perspectives that demand the attention of economists as well as computer scientists. The all-star list of author-contributors makes this book the best place for newcomers to begin their studies." Paul Milgrom, Shirley and Leonard Ely Professor of Humanities and Sciences and Professor of Economics, Stanford University
"Computer scientists never lose sight of the fact that a solution to an economic or social problem is not really feasible unless it is computationally tractable, and their toolkit has the potential to give new theoretical flesh to venerable economic intuitions such as the invisible hand, or the problematic nature of market socialism. Algorithmic Game Theory is a collection of essays by leading computer scientists and economists surveying the state of the art, and the open problems, in the many branches of this rapidly moving area. It is ideal for graduate students, and for established researchers in either economics or computer science, who wish to learn about the concepts and issues shaping an increasingly important stream of interdisciplinary research." Professor Andrew McLennan, School of Economics, University of Queensland
"The most exciting current research in game theory and its applications is being done in computer science. Algorithmic Game Theory effectively brings the reader to the frontiers of this research." Ehud Kalai, James J. O'Connor Distinguished Professor of Decision and Game Sciences, Kellogg School of Management, Northwestern University
"I recommend Algorithmic Game Theory." Dave Levin, SIGACT News
Book Description
This book, first published in 2007, covers algorithmic game theory, with contributions from all the leading researchers.
About the Author
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.
In the last few years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. 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 incentives and pricing, cost sharing, information markets and cryptography and security. Students, researchers and practitioners alike need to learn more about these fascinating theoretical developments and their widespread practical application.
Review
"The subject matter of Algorithmic Game Theory covers many of the hottest area of useful new game theory research, introducing deep new problems, techniques, and perspectives that demand the attention of economists as well as computer scientists. The all-star list of author-contributors makes this book the best place for newcomers to begin their studies."
Paul Milgrom, Shirley and Leonard Ely Professor of Humanities and Sciences and Professor of Economics, Stanford University
"Computer scientists never lose sight of the fact that a solution to an economic or social problem is not really feasible unless it is computationally tractable, and their toolkit has the potential to give new theoretical flesh to venerable economic intuitions such as the invisible hand, or the problematic nature of market socialism. Algorithmic Game Theory is a collection of essays by leading computer scientists and economists surveying the state of the art, and the open problems, in the many branches of this rapidly moving area. It is ideal for graduate students, and for established researchers in either economics or computer science, who wish to learn about the concepts and issues shaping an increasingly important stream of interdisciplinary research."
Professor Andrew McLennan, School of Economics, University of Queensland
"The most exciting current research in game theory and its applications is being done in computer science. Algorithmic Game Theory effectively brings the reader to the frontiers of this research."
Ehud Kalai, James J. O'Connor Distinguished Professor of Decision and Game Sciences, Kellogg School of Management, Northwestern University
"I recommend Algorithmic Game Theory."
Dave Levin, SIGACT News
Book Description
This book, first published in 2007, covers algorithmic game theory, with contributions from all the leading researchers.
About the Author
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.