The DOI matches its Crossref record.
Computationally Manageable Combinational Auctions
Abstract
There is interest in designing simultaneous auctions for situations such as the recent FCC radio spectrum auctions, in which the value of assets to a bidder depends on which other assets he or she wins. In such auctions, bidders may wish to submit bids for combinations of assets. When this is allowed, the problem of determining the revenue maximizing set of nonconflicting bids can be difficult. We analyze this problem, identifying several different structures of permitted combinational bids for which computational tractability is constructively demonstrated and some structures for which computational tractability cannot be guaranteed.
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.
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
Cited by
Putting Auction Theory to Work
Milgrom, P. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511813825 · Cited by 1,642
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
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
Analyzing the Airwaves Auction
McAfee, R. P., & McMillan, J. (1996) · Journal of Economic Perspectives · doi:10.1257/jep.10.1.159 · Cited by 530
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
Metadata
- Authors
- Rothkopf, M. H., Pekeč, A., & Harstad, R. M.
- Venue
- Management Science
- Published
- 1998-08
- Volume
- 44
- Issue
- 8
- Pages
- 1131-1147
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2163675995
- Cited by
- 1,024
- References
- 0
- FWCI
- 77.07
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computationally Manageable Combinational Auctions. https://app.cochat.ai/papers/10.1287/mnsc.44.8.1131
- The paper
- Rothkopf, M. H., Pekeč, A., & Harstad, R. M. (1998). Computationally Manageable Combinational Auctions. Management Science. https://doi.org/10.1287/mnsc.44.8.1131
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.
