The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
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.
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
(1979) · Cited by 43,841
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
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
Graph Theory with Applications
Bondy, J. A., & Murty, U. S. R. (1976) · doi:10.1007/978-1-349-03521-2 · Cited by 9,043
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
Theory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
Brucker, P. (1995) · Scheduling Algorithms · doi:10.1007/978-3-662-03088-2_3 · Cited by 2,289
Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (2011) · Cited by 2,088
Maximum matching and a polyhedron with 0,1-vertices
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.013 · Cited by 1,712
Graham, R., Grötschel, M., & Lovász, L. (1995) · Medical Entomology and Zoology · Cited by 1,526
McMillan, J. (1994) · The Journal of Economic Perspectives · doi:10.1257/jep.8.3.145 · Cited by 699
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
A Combinatorial Auction Mechanism for Airport Time Slot Allocation
Rassenti, S. J., Smith, V. L., & Bulfin, R. L. (1982) · The Bell Journal of Economics · doi:10.2307/3003463 · Cited by 547
Allocating Uncertain and Unresponsive Resources: An Experimental Approach
Banks, J. S., Ledyard, J. O., & Porter, D. P. (1989) · The RAND Journal of Economics · doi:10.2307/2555648 · Cited by 284
Mutually Destructive Bidding: The FCC Auction Design Problem
Bykowsky, M. M., Cull, R. J., & Ledyard, J. O. (2000) · Journal of Regulatory Economics · doi:10.1023/a:1008122015102 · Cited by 171
Smart Computer-Assisted Markets
McCabe, K., Rassenti, S., & Smith, V. L. (1991) · Science · doi:10.1126/science.254.5031.534 · Cited by 116
Pulleyblank, W. R. (1996) · The MIT Press eBooks · Cited by 71
Cited by
Putting Auction Theory to Work
Milgrom, P. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511813825 · Cited by 1,642
Nisan, N., & Ronen, A. (2001) · Games and Economic Behavior · doi:10.1006/game.1999.0790 · Cited by 1,331
Consensus-Based Decentralized Auctions for Robust Task Allocation
Choi, H.-L., Brunet, L., & How, J. P. (2009) · IEEE Transactions on Robotics · doi:10.1109/tro.2009.2022423 · Cited by 1,128
Roth, A. E. (2002) · Econometrica · doi:10.1111/1468-0262.00335 · Cited by 1,004
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
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
- 19
- 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
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.