The DOI matches its Crossref record.
Iterative Combinatorial Auctions
Open accessAbstract
This chapter offers information on iterative combinatorial auctions (CAs) that help in solving the problem of costly preference elicitation that arises due to the hard problem of winner determination. In this auction mechanism, bidders are allowed to submit multiple bids and are also provided with information feedback so that they can use this feedback and price discovery in expressing their preferences. Iterative CAs help in the verification and validation of an auction outcome, and also enhance revenue and efficiency in single item auctions by facilitating exchange of value information between bidders. The chapter also discusses the concepts of minimal competitive equilibrium (CE) prices and universal CE prices for CAs, which have a role in the preference elicitation problem. Several other issues, including the design space of iterative CAs and price-based iterative CAs, and a case study of an efficient ascending price auction, are also presented.
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
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
Budish, E. (2011) · Journal of Political Economy · doi:10.1086/664613 · Cited by 766
Metadata
- Authors
- Parkes, D. C.
- Venue
- Combinatorial Auctions
- Publisher
- The MIT Press
- Published
- 2005-12-09
- Pages
- 41-78
- OpenAlex
- W2141679133
- Cited by
- 162
- References
- 0
- FWCI
- 34.49
- Type
- book chapter
- 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: Iterative Combinatorial Auctions. https://app.cochat.ai/papers/10.7551/mitpress/9780262033428.003.0003
- The paper
- Parkes, D. C. (2005). Iterative Combinatorial Auctions. Combinatorial Auctions. https://doi.org/10.7551/mitpress/9780262033428.003.0003
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.