The DOI matches its OpenAlex record; 9 of the 9 references it cites were found in a registry or an index.
An Algorithm for Optimal Winner Determination in Combinatorial Auctions
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Depth-first iterative-deepening
Korf, R. E. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90084-0 · Cited by 1,562
Clique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369
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
A Combinatorial Auction Mechanism for Airport Time Slot Allocation
Rassenti, S., & Bulfin, R. L. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511528354.035 · Cited by 583
Analyzing the Airwaves Auction
McAfee, R. P., & McMillan, J. (1996) · Journal of Economic Perspectives · doi:10.1257/jep.10.1.159 · Cited by 530
An implementation of the contract net protocol based on marginal cost calculations
Sandholm, T. (1993) · National Conference on Artificial Intelligence · Cited by 457
Self-citationEfficient bounds for the stable set, vertex cover and set packing problems
Hochbaum, D. S. (1983) · Discrete Applied Mathematics · doi:10.1016/0166-218x(83)90080-x · Cited by 272
Halldórsson, M. M., & Lau, H. C. (1997) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00003 · Cited by 43
Cited by
Nisan, N., & Ronen, A. (2001) · Games and Economic Behavior · doi:10.1006/game.1999.0790 · Cited by 1,331
Combinatorial Auctions: A Survey
de Vries, S., & Vohra, R. V. (2003) · INFORMS Journal on Computing · doi:10.1287/ijoc.15.3.284.16077 · Cited by 985
Coalition structure generation with worst case guarantees
Sandholm, T., Larson, K., Andersson, M., Shehory, O., & Tohmé, F. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00036-3 · Cited by 740
Self-citationTruth 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
Combinatorial auctions with decreasing marginal utilities
Lehmann, B., Lehmann, D., & Nisan, N. (2006) · Games and Economic Behavior · doi:10.1016/j.geb.2005.02.006 · Cited by 471
Metadata
- Authors
- Sandholm, T.
- Venue
- Open Scholarship Institutional Repository (Washington University in St. Louis)
- Publisher
- Washington University in St. Louis
- Published
- 1999-01-01
- Pages
- 542-547
- OpenAlex
- W2126722697
- Cited by
- 325
- References
- 9
- FWCI
- 66.86
- Type
- journal article
- Language
- en
- Open access
- green
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: An Algorithm for Optimal Winner Determination in Combinatorial Auctions. https://app.cochat.ai/papers/10.7936/k74j0cb1
- The paper
- Sandholm, T. (1999). An Algorithm for Optimal Winner Determination in Combinatorial Auctions. Open Scholarship Institutional Repository (Washington University in St. Louis). https://doi.org/10.7936/k74j0cb1
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.