Machine Learning-Powered Combinatorial Clock Auction

arXiv:2308.10226v2 Announce Type: replace-cross
Abstract: We study the design of iterative combinatorial auctions (ICAs). The main challenge in this domain is that the bundle space grows exponentially in the number of items. To address this, several papers have recently proposed machine learning (ML)-based preference elicitation algorithms that aim to elicit only the most important information from bidders. However, from a practical point of view, the main shortcoming of this prior work is that those designs elicit bidders' preferences via value …

abstract aim algorithms arxiv challenge cs.ai cs.gt cs.lg design domain information iterative machine machine learning papers space study type