Algorithmic Game Theory
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Algorithmic Game Theory
Algorithmic Game Theory

Algorithmic Game Theory


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
About the Book

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.

Table of Contents:
Introduction Noam Nisan, Tim Roughgarden, Éva Tardos and Vijay V. Vazirani; Part I. Computing in Games: 1. Basic solution concepts and computational issues Éva Tardos and Vijay V. Vazirani; 2. Algorithms for equilibria Christos Papadimitriou; 3. Equilibrium computation for games in strategic and extensive form Bernhard von Stengel; 4. Learning, regret minimization and correlated equilibria Avrim Blum and Yishay Mansour; 5. Graphical games Michael J. Kearns; 6. Cryptography and game theory Yevgeniy Dodis and Tal Rabin; 7. Combinatorial algorithms for market equilibria Vijay V. Vazirani; 8. Computation of market equilibria by convex programming Bruno Codenotti and Kasturi Varadarajan; Part II. Algorithmic Mechanism Design: 9. Introduction to mechanism design (for computer scientists) Noam Nisan; 10. Mechanism design without money James Schummer and Rakesh V. Vohra; 11. Combinatorial auctions Noam Nisan and Liad Blumrosen; 12. Computationally efficient approximation mechanisms Ron Lavi; 13. Profit maximization in mechanism design Jason Hartline and Anna Karlin; 14. Distributed algorithmic mechanism design Joan Feigenbaum, Michael Schapira and Scott Shenker; 15. Cost sharing Kamal Jain and Mohammad Mahdian; 16. On-line mechanisms David C. Parkes; Part III. Quantifying the Inefficiency of Equilibria: 17. Introduction to the inefficiency of equilibria Tim Roughgarden and Éva Tardos; 18. Routing games Tim Roughgarden; 19. Inefficiency of equilibria in network formation games Éva Tardos and Tom Wexler; 20. Selfish load-balancing Berthold Vöcking; 21. Efficiency loss and the design of scalable resource allocation mechanisms Ramesh Johari; Part IV. Additional Topics: 22. Incentives and pricing in communication networks Asuman Ozdaglar and R. Srikant; 23. Incentives in peer-to-peer systems John Chuang, Michal Feldman and Moshe Babaioff; 24. Cascading behavior in networks: algorithmic and economic issues Jon Kleinberg; 25. Incentives and information security Ross Anderson, Tyler Moore, Shishir Nagaraja and Andy Ozment; 26. Computational aspects of information markets David M. Pennock and Rahul Sami; 27. Manipulation-resistant reputation systems Eric Friedman, Paul Resnick and Rahul Sami; 28. Sponsored search auctions Sebastien Lahaie, David M. Pennock, Amin Saberi and Rakesh V. Vohra; 29. Algorithmic issues in evolutionary game theory Michael Kearns and Siddharth Suri.

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.

Review :
'… a tome to be dipped into by researchers and developers who would want to know more about certain aspects of the field and particular 'state-of-the-art' issues and applications.' Kybernetes


Best Sellers


Product Details
  • ISBN-13: 9780511800481
  • Publisher: Cambridge University Press
  • Publisher Imprint: Cambridge University Press (Virtual Publishing)
  • Language: English
  • ISBN-10: 0511800487
  • Publisher Date: 31 Jan 2011
  • Binding: Digital download and online


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithmic Game Theory
Cambridge University Press -
Algorithmic Game Theory
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Algorithmic Game Theory

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!