Combinatorial auction
A combinatorial auction is a type of smart market in which participants can place bids on combinations of discrete heterogeneous items, or “packages”, rather than individual items or continuous quantities. These packages can be also called lots and the whole auction a multi-lot auction.[1] Combinatorial auctions are applicable when bidders have non-additive valuations on bundles of items, that is, they value combinations of items more or less than the sum of their valuations of individual elements of the combination.
Simple combinatorial auctions have been used for many years in estate auctions, where a common procedure is to accept bids for packages of items. They have been used recently for truckload transportation, bus routes, industrial procurement, and in the allocation of radio spectrum for wireless communications. In recent years, procurement teams have applied reverse combinatorial auctions in the procurement of goods and services. This application is often referred to as sourcing optimization.
Although they allow bidders to be more expressive, combinatorial auctions present both computational and game-theoretic challenges compared to traditional auctions. An example of a computational problem is how to efficiently determine the allocation once the bids have been submitted to the auctioneer. This is called the winner determination problem.
The winner determination problem can be stated as follows: given a set of bids in a combinatorial auction, find an allocation of items to bidders—including the possibility that the auctioneer retains some items—that maximizes the auctioneer’s revenue. This problem is difficult for large instances. Specifically, it is NP-hard, meaning that it is conjectured that there does not exist a polynomial-time algorithm which finds the optimal allocation. The combinatorial auction problem can be modeled as a set packing problem. Therefore, many algorithms have been proposed to find approximated solutions for combinatorial auction problem. For example, Hsieh (2010) proposed a Lagrangian relaxation approach for combinatorial reverse auction problems.
Many of these aspects of combinatorial auctions, including some real-world examples, are also discussed in the comprehensive book edited by Cramton, Shoham and Steinberg (2006).
History
Combinatorial auctions were first proposed by Rassenti, Smith, and Bulfin (1982), for the allocation of airport landing slots. Their paper introduced many key ideas on combinatorial auctions, including the mathematical programming formulation of the auctioneer’s problem, the connection between the winner determination problem and the set-packing problem, the issue of computational complexity, the use of techniques from experimental economics for testing combinatorial auctions, and consideration of issues of incentive compatibility and demand revelation in combinatorial auctions.
Combinatorial Clock Auction
A special case of a combinatorial auction is the combinatorial clock auction (CCA), which combines a clock auction, during which bidders may provide their confirmations in response to the rising prices, with a subsequantial sealed bid auction, in which bidders submit sealed package bids. The auctioneer uses the final bids to compute the best value allocation and the Vickrey payments.[2][3]
References
- Mullen, Tracy; Wellman, Michael P. (1998). "The Auction Manager: Market Middleware for Large-Scale Electronic Commerce" (PDF). USENIX Workshop on Electronic Commerce.
- Bichler, Martin; Goeree, Jacob K. (26 October 2017). Handbook of Spectrum Auction Design. Cambridge University Press. ISBN 978-1-107-13534-5. Retrieved 22 October 2020.
- Ausubel, Lawrence M.; Baranov, Oleg (1 October 2017). "A Practical Guide to the Combinatorial Clock Auction". The Economic Journal. 127 (605): F334–F350. doi:10.1111/ecoj.12404. ISSN 0013-0133. S2CID 26571660.
Further reading
- Peter Cramton, Yoav Shoham, and Richard Steinberg (2006). Combinatorial Auctions. MIT Press. ISBN 0-262-03342-9. A contributed book with broad coverage of the topic.
- de Vries, S.; Vohra, R. (2003). "Combinatorial auctions: A survey" (PDF). INFORMS Journal on Computing. 15 (3): 284–309. CiteSeerX 10.1.1.23.8046. doi:10.1287/ijoc.15.3.284.16077. ISSN 1526-5528. A bit dated, but a classic survey.
- Vazirani, Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0.. A contributed book with a good introductory chapter on combinatorial auctions from a computer science theory perspective; see Chapter 11. :267–299
- Rassenti, Stephen J.; Smith, Vernon L.; Bulfin, Robert L. (1982). "A Combinatorial Auction Mechanism for Airport Time Slot Allocation" (PDF). Bell Journal of Economics. 13 (2): 402–417. doi:10.2307/3003463. JSTOR 3003463. Early work that popularized the idea of a combinatorial auction.
- Rothkopf, M.; Pekec, A.; Harstad, R. (1998). "Computationally manageable combinatorial auctions". Management Science. 44 (8): 1131–1147. CiteSeerX 10.1.1.723.9753. doi:10.1287/mnsc.44.8.1131. An influential early paper on computational considerations.
- Hammami, Farouk; Rekik, Monia; Coelho, Leandro C. (2019). "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet". Transportation Research Part e: Logistics and Transportation Review. 127: 150–177. doi:10.1016/j.tre.2019.05.009. An application of combinatorial auctions for transportation services procurement.
- Hsieh, Fu-Shiung (2010). "Combinatorial reverse auction based on revelation of Lagrangian multipliers" (PDF). Decision Support Systems. 48 (2): 323–330. doi:10.1016/j.dss.2009.08.009.
- Shoham, Yoav; Leyton-Brown, Kevin (2009). Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. New York: Cambridge University Press. ISBN 978-0-521-89943-7. An overview in textbook form; see Section 11.3. Downloadable free online.