Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 325

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 access
Tüomas Sandholm · 1999 · Open Scholarship Institutional Repository (Washington University in St. Louis)

Overview

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

OpenAlex · 10.7936/k74j0cb1

Cites

9 of 9 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 9 references

Cited by

See all 325

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.