Learning strong substitutes demand via queries

Journal article

This article addresses the computational challenges of learning strong substitutes demand when given access to a demand (or valuation) oracle. Strong substitutes demand generalises the well-studied gross substitutes demand to a multi-unit setting. Recent work by Baldwin and Klemperer shows that any such demand can be expressed in a natural way as a finite list of weighted bid vectors. A simplified version of this bidding language has been used by the Bank of England.

Assuming access to a demand oracle, we provide an algorithm that computes the unique list of weighted bid vectors corresponding to a bidder’s demand preferences. In the special case where their demand can be expressed using positive bids only, we have an efficient algorithm that learns this list in linear time. We also show super-polynomial lower bounds on the query complexity of computing the list of bids in the general case where bids may be positive and negative. Our algorithms constitute the first systematic approach for bidders to construct a bid list corresponding to non-trivial demand, allowing them to participate in “product-mix” auctions.

Authors: Lock, E; Goldberg, PW; Marmolejo-Cossío, FJ

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Association for Computing Machinery
• Journal: ACM Transactions on Economics and Computation
• Volume: 10
• Issue: 2
• Article number: 10
• Publication date: 2022-10-07
• Acceptance date: 2022-06-30
• DOI: 10.1145/3546604
• EISSN: 2167-8383
• ISSN: 2167-8375
• Language: English
• Keywords: query protocol; preference elicitation; learning demand; strong substitutes; bidding language; FFR; product-mix auction