The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Algorithmic game theory
Abstract
A new era of theoretical computer science addresses fundamental problems about auctions, networks, and human behavior.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS
Vickrey, W. (1961) · The Journal of Finance · doi:10.1111/j.1540-6261.1961.tb02789.x · Cited by 7,722
Equilibrium points in n -person games
Nash, J. F. (1950) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.36.1.48 · Cited by 7,560
Myerson, R. B. (1981) · Mathematics of Operations Research · doi:10.1287/moor.6.1.58 · Cited by 5,920
Monderer, D., & Shapley, L. S. (1996) · Games and Economic Behavior · doi:10.1006/game.1996.0044 · Cited by 3,543
A class of games possessing pure-strategy Nash equilibria
Rosenthal, R. W. (1973) · International Journal of Game Theory · doi:10.1007/bf01737559 · Cited by 2,008
Roughgarden, T., & Tardos, É. (2002) · Journal of the ACM · doi:10.1145/506147.506153 · Cited by 1,608
Self-citation(2017) · Lexikon des gesamten Buchwesens Online · doi:10.1163/9789004337862_lgbo_com_161117 · Cited by 1,432
Nisan, N., & Ronen, A. (2001) · Games and Economic Behavior · doi:10.1006/game.1999.0790 · Cited by 1,331
The Complexity of Computing a Nash Equilibrium
Daskalakis, C., Goldberg, P. W., & Papadimitriou, C. H. (2009) · SIAM Journal on Computing · doi:10.1137/070699652 · Cited by 921
On the complexity of the parity argument and other inefficient proofs of existence
Papadimitriou, C. H. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80063-7 · Cited by 778
Johnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90046-3 · Cited by 705
The complexity of pure Nash equilibria
Fabrikant, A., Papadimitriou, C., & Talwar, K. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007445 · Cited by 650
Settling the complexity of computing two-player Nash equilibria
Chen, X., Deng, X., & Teng, S.-H. (2009) · Journal of the ACM · doi:10.1145/1516512.1516516 · Cited by 560
The price of anarchy is independent of the network topology
Roughgarden, T. (2003) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(03)00044-8 · Cited by 398
Self-citationA crash course in implementation theory
Jackson, M. O. (2001) · Social Choice and Welfare · doi:10.1007/s003550100152 · Cited by 372
Intrinsic robustness of the price of anarchy
Roughgarden, T. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536485 · Cited by 319
Self-citationOn total functions, existence theorems and computational complexity
Megiddo, N., & Papadimitriou, C. H. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(91)90200-l · Cited by 291
On the Complexity of Nash Equilibria and Other Fixed Points
Etessami, K., & Yannakakis, M. (2010) · SIAM Journal on Computing · doi:10.1137/080720826 · Cited by 249
The complexity of computing a Nash equilibrium
Daskalakis, C., Goldberg, P. W., & Papadimitriou, C. H. (2009) · Communications of the ACM · doi:10.1145/1461928.1461951 · Cited by 235
On the Hardness of Being Truthful
Papadimitriou, C. H., Schapira, M., & Singer, Y. (2008) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2008.54 · Cited by 150
Equilibrium Points of Bimatrix Games
Mangasarian, O. L. (1964) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0112064 · Cited by 140
Computer science and game theory
Shoham, Y. (2008) · Communications of the ACM · doi:10.1145/1378704.1378721 · Cited by 108
Computing equilibria: a computational complexity perspective
Roughgarden, T. (2009) · Economic Theory · doi:10.1007/s00199-009-0448-y · Cited by 59
Self-citationComputational challenges in e-commerce
Feigenbaum, J., Parkes, D. C., & Pennock, D. M. (2008) · Communications of the ACM · doi:10.1145/1435417.1435435 · Cited by 36
Cited by
SoK: Decentralized Finance (DeFi)
Werner, S., Perez, D., Gudgeon, L., Klages-Mundt, A., Harz, D., & Knottenbelt, W. (2022) · Proceedings of the 4th ACM Conference on Advances in Financial Technologies · doi:10.1145/3558535.3559780 · Cited by 404
Cake cutting: not just child's play
Procaccia, A. D. (2013) · Communications of the ACM · doi:10.1145/2483852.2483870 · Cited by 156
Open Problems in Cooperative AI
Dafoe, A., Hughes, E., Bachrach, Y., Collins, T., McKee, K. R., Leibo, J. Z., Larson, K., & Graepel, T. (2020) · arXiv · doi:10.48550/arxiv.2012.08630 · Cited by 93
Chen, Q., & Heydari, B. (2022) · Journal of Mechanical Design · doi:10.1115/1.4055057 · Cited by 12
Metadata
- Authors
- Roughgarden, T.
- Venue
- Communications of the ACM
- Published
- 2010-07
- Volume
- 53
- Issue
- 7
- Pages
- 78-86
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W4294576339
- Cited by
- 288
- References
- 24
- FWCI
- 6.10
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.