The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Applications of approximation algorithms to cooperative games
Abstract
The Internet, which is intrinsically a common playground for a large number of players with varying degrees of collab-orative and selsh motives, naturally gives rise to numerous new game theoretic issues. Computational problems under-
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
Edmonds, J. (1967) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.071b.032 · Cited by 731
Cited by
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
Metadata
- Authors
- Jain, K., & Vazirani, V.
- Venue
- Proceedings of the thirty-third annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2001-07-06
- Pages
- 364-372
- OpenAlex
- W2095969632
- Cited by
- 211
- References
- 1
- FWCI
- 111.18
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Applications of approximation algorithms to cooperative games. https://app.cochat.ai/papers/10.1145/380752.380825
- The paper
- Jain, K., & Vazirani, V. (2001). Applications of approximation algorithms to cooperative games. Proceedings of the thirty-third annual ACM symposium on Theory of computing. https://doi.org/10.1145/380752.380825
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.