The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Algorithmic Mechanism Design
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
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Myerson, R. B. (1981) · Mathematics of Operations Research · doi:10.1287/moor.6.1.58 · Cited by 5,920
(1994) · Cited by 5,513
Groves, T. (1973) · Econometrica · doi:10.2307/1914085 · Cited by 3,284
Multipart pricing of public goods
Clarke, E. H. (1971) · Public Choice · doi:10.1007/bf01726210 · Cited by 3,246
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
Computationally Manageable Combinational Auctions
Rothkopf, M. H., Pekeč, A., & Harstad, R. M. (1998) · Management Science · doi:10.1287/mnsc.44.8.1131 · Cited by 1,024
Roth, A. E. (2002) · Econometrica · doi:10.1111/1468-0262.00335 · Cited by 1,004
(1994) · Medical Entomology and Zoology · Cited by 995
Cited by
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks
Zhong, S., Chen, J., & Yang, Y. R. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209220 · Cited by 1,219
Algorithms, games, and the internet
Papadimitriou, C. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380883 · Cited by 1,085
Game theory meets network security and privacy
Manshaei, M. H., Zhu, Q., Alpcan, T., Bacşar, T., & Hubaux, J.-P. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480742 · Cited by 808
Privacy preserving auctions and mechanism design
Naor, M., Pinkas, B., & Sumner, R. (1999) · Proceedings of the 1st ACM conference on Electronic commerce · doi:10.1145/336992.337028 · Cited by 753
Truth revelation in approximately efficient combinatorial auctions
Lehmann, D., Oćallaghan, L. I., & Shoham, Y. (2002) · Journal of the ACM · doi:10.1145/585265.585266 · Cited by 655
A survey on networking games in telecommunications
Altman, E., Boulogne, T., El-Azouzi, R., Jiménez, T., & Wynter, L. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2004.06.005 · Cited by 552
Algorithmic mechanism design (extended abstract)
Nisan, N., & Ronen, A. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301287 · Cited by 476
Self-citationTussle in cyberspace: defining tomorrow's Internet
Clark, D. D., Wroclawski, J., Sollins, K. R., & Braden, R. (2005) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2005.850224 · Cited by 411
Sharing the Cost of Multicast Transmissions
Feigenbaum, J., Papadimitriou, C. H., & Shenker, S. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2001.1754 · Cited by 404
Approximate mechanism design without money
Procaccia, A. D., & Tennenholtz, M. (2009) · Proceedings of the 10th ACM conference on Electronic commerce · doi:10.1145/1566374.1566401 · Cited by 307
Roughgarden, T. (2010) · Communications of the ACM · doi:10.1145/1785414.1785439 · Cited by 288
Tussle in cyberspace: defining tomorrow's internet
Clark, D. D., Wroclawski, J., Sollins, K. R., & Braden, R. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633059 · Cited by 257
Competitive auctions and digital goods
Goldberg, A. V., Hartline, J. D., & Wright, A. (2001) · doi:10.5555/365411.365768 · Cited by 257
Overcoming free-riding behavior in peer-to-peer systems
Feldman, M., & Chuang, J. (2005) · ACM SIGecom Exchanges · doi:10.1145/1120717.1120723 · Cited by 253
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
Open Challenges in Multi-Agent Security: Towards Secure Systems of Interacting AI Agents
de Witt, C. S., Krawiecka, K., Krawczuk, I., Hagag, B., Anderson, W. L., Belcak, P., Bucknall, B., Cai, X., Chopra, A., Cohen, D., et al. (2025) · arXiv · doi:10.48550/arxiv.2505.02077 · Cited by 108
Metadata
- Authors
- Nisan, N., & Ronen, A.
- Venue
- Games and Economic Behavior
- Publisher
- Elsevier BV
- Published
- 2001-04
- Volume
- 35
- Issue
- 1-2
- Pages
- 166-196
- ISSN
- 0899-8256 (ISSN-L)
- OpenAlex
- W2012634103
- Cited by
- 1,331
- References
- 30
- FWCI
- 158.39
- 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.