Algorithmic game theory
- 1 July 2010
- journal article
- review article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 53 (7), 78-86
- https://doi.org/10.1145/1785414.1785439
Abstract
A new era of theoretical computer science addresses fundamental problems about auctions, networks, and human behavior.Keywords
Funding Information
- Division of Computing and Communication Foundations (CCF-0448664)
This publication has 30 references indexed in Scilit:
- Settling the complexity of computing two-player Nash equilibriaJournal of the ACM, 2009
- The complexity of computing a Nash equilibriumCommunications of the ACM, 2009
- Computational challenges in e-commerceCommunications of the ACM, 2009
- Single-value combinatorial auctions and algorithmic implementation in undominated strategiesJournal of the ACM, 2009
- Computer science and game theoryCommunications of the ACM, 2008
- How bad is selfish routing?Journal of the ACM, 2002
- Paradoxical behaviour of mechanical and electrical networksNature, 1991
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973
- Über ein Paradoxon aus der VerkehrsplanungMathematical Methods of Operations Research, 1968
- COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERSThe Journal of Finance, 1961