Skip to main content Accessibility help
×
Hostname: page-component-7c8c6479df-ph5wq Total loading time: 0 Render date: 2024-03-28T05:03:49.567Z Has data issue: false hasContentIssue false

Preface

Published online by Cambridge University Press:  31 January 2011

Noam Nisan
Affiliation:
School of Computer Science and Engineering Hebrew University of Jerusalem
Tim Roughgarden
Affiliation:
Department of Computer Science Stanford University
Éva Tardos
Affiliation:
Department of Computer Science Cornell University
Vijay V. Vazirani
Affiliation:
College of Computing Georgia Institute of Technology
Noam Nisan
Affiliation:
Hebrew University of Jerusalem
Tim Roughgarden
Affiliation:
Stanford University, California
Eva Tardos
Affiliation:
Cornell University, New York
Vijay V. Vazirani
Affiliation:
Georgia Institute of Technology
Get access

Summary

This book covers an area that straddles two fields, algorithms and game theory, and has applications in several others, including networking and artificial intelligence. Its text is pitched at a beginning graduate student in computer science – we hope that this makes the book accessible to readers across a wide range of areas.

We started this project with the belief that the time was ripe for a book that clearly develops some of the central ideas and results of algorithmic game theory – a book that can be used as a textbook for the variety of courses that were already being offered at many universities. We felt that the only way to produce a book of such breadth in a reasonable amount of time was to invite many experts from this area to contribute chapters to a comprehensive volume on the topic.

This book is partitioned into four parts: the first three parts are devoted to core areas, while the fourth covers a range of topics mostly focusing on applications. Chapter 1 serves as a preliminary chapter and it introduces basic game-theoretic definitions that are used throughout the book. The first chapters of Parts II and III provide introductions and preliminaries for the respective parts. The other chapters are largely independent of one another. The authors were requested to focus on a few results highlighting the main issues and techniques, rather than provide comprehensive surveys.

Type
Chapter
Information
Algorithmic Game Theory , pp. xvii - xviii
Publisher: Cambridge University Press
Print publication year: 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Preface
    • By Noam Nisan, School of Computer Science and Engineering Hebrew University of Jerusalem, Tim Roughgarden, Department of Computer Science Stanford University, Éva Tardos, Department of Computer Science Cornell University, Vijay V. Vazirani, College of Computing Georgia Institute of Technology
  • Edited by Noam Nisan, Hebrew University of Jerusalem, Tim Roughgarden, Stanford University, California, Eva Tardos, Cornell University, New York, Vijay V. Vazirani, Georgia Institute of Technology
  • Book: Algorithmic Game Theory
  • Online publication: 31 January 2011
  • Chapter DOI: https://doi.org/10.1017/CBO9780511800481.002
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Preface
    • By Noam Nisan, School of Computer Science and Engineering Hebrew University of Jerusalem, Tim Roughgarden, Department of Computer Science Stanford University, Éva Tardos, Department of Computer Science Cornell University, Vijay V. Vazirani, College of Computing Georgia Institute of Technology
  • Edited by Noam Nisan, Hebrew University of Jerusalem, Tim Roughgarden, Stanford University, California, Eva Tardos, Cornell University, New York, Vijay V. Vazirani, Georgia Institute of Technology
  • Book: Algorithmic Game Theory
  • Online publication: 31 January 2011
  • Chapter DOI: https://doi.org/10.1017/CBO9780511800481.002
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Preface
    • By Noam Nisan, School of Computer Science and Engineering Hebrew University of Jerusalem, Tim Roughgarden, Department of Computer Science Stanford University, Éva Tardos, Department of Computer Science Cornell University, Vijay V. Vazirani, College of Computing Georgia Institute of Technology
  • Edited by Noam Nisan, Hebrew University of Jerusalem, Tim Roughgarden, Stanford University, California, Eva Tardos, Cornell University, New York, Vijay V. Vazirani, Georgia Institute of Technology
  • Book: Algorithmic Game Theory
  • Online publication: 31 January 2011
  • Chapter DOI: https://doi.org/10.1017/CBO9780511800481.002
Available formats
×