Adaptive Pricing in Combinatorial Auctions

We introduce the first adaptively priced iterative combinatorial auction design, which gradually extends price expressiveness as the rounds progress. This mechanism achieves both high efficiency and fast convergence across a wide range of valuation domains. We implement our auction design using polynomial prices, show how to detect when the current price structure is insufficient to clear the market, and show how to correctly expand the polynomial structure to guarantee progress. An experimental evaluation confirms that our auction is competitive with bundle-price auctions in domains where these excel, namely multiminded valuations, but also performs well in domains favorable to linear prices, such as valuations with pairwise synergy. This paper was accepted by Axel Ockenfels, behavioral economics and decision analysis. Supplemental Material: The data files are available at https://doi.org/10.1287/mnsc.2024.4993 .

• 저널Management Science · 71(10) · 8967–8993
• 토픽Auction Theory and Applications · Management Science and Operations Research
• DOI10.1287/mnsc.2024.4993
• 저자Sébastien Lahaie, Benjamin Lubin