Algorithmic Game Theory
79 ratings by Goodreads
Language: English
Published by Cambridge University Press, 2007
- Hardcover
- New

Seller: thebookforest.com, San Rafael, CA, U.S.A.thebookforest.com
4-star seller
AbeBooks seller since January 3, 2023
Hardcover
Condition: New
US$ 69.99
US$ 4.99 shipping
Ships within U.S.A.
Quantity: 1 available
Add to basketFree 30-day returns
Seller Inventory # BAY12-00170
- Title
- Algorithmic Game Theory
- Publisher
- Cambridge University Press
- Publication year
- 2007
- Condition
- New
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0521872820
- ISBN 13
- 9780521872829
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.
"Synopsis" may belong to another edition of this title.
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.
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.
"About the title" may belong to another edition of this title.
thebookforest.com
San Rafael, CA, U.S.A.
4-star seller
AbeBooks seller since January 3, 2023
Shipping rates within U.S.A.
| Item | 5 to 14 business days | 3 to 6 business days |
|---|---|---|
| First item | US$ 4.99 | US$ 8.99 |
Payment methods
Store description
Since 2010, the Book Forest has raised over 3 million dollars for participating public libraries.
Seller's business information
CA, U.S.A.
Shipping terms
Orders ship within 24 hours of receipt. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or over sized, we may contact you to let you know extra shipping is required.