FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Algorithmic Game Theory

Algorithmic Game Theory

Noam Nisan
    Product form
      FORMAT: Hardback

      R 3,357.53 Price and availability exclusive to website

      YOU COULD EARN 3,357.53 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 559.58 per month!
      3x monthly payments of R 1,119.17 with
      4x fortnightly payments of R 839.38 with

      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.

      Format: Hardback CONTRIBUTORS: Noam Nisan EAN: 9780521872829 COUNTRY: United Kingdom PAGES: 778 WEIGHT: 1590 g HEIGHT: 259 mm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 2007-09-24 CITY: GENRE: COMPUTERS / Programming / Algorithms, MATHEMATICS / Game Theory WIDTH: 185 mm SPINE:

      Book Themes:

      Game theory, Algorithms and data structures

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      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 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.

      Format: Hardback CONTRIBUTORS: Noam Nisan EAN: 9780521872829 COUNTRY: United Kingdom PAGES: 778 WEIGHT: 1590 g HEIGHT: 259 mm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 2007-09-24 CITY: GENRE: COMPUTERS / Programming / Algorithms, MATHEMATICS / Game Theory WIDTH: 185 mm SPINE:

      Book Themes:

      Game theory, Algorithms and data structures

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      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.

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account