Weakest Bidder Types and New Core-Selecting Combinatorial Auctions
Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm

TL;DR
This paper introduces a new class of core-selecting combinatorial auctions that utilize prior bidder information to overcome incentive compatibility limitations, improving revenue, fairness, and computational efficiency.
Contribution
It presents a novel auction design leveraging known bidder type constraints to achieve incentive compatibility and develops new computational techniques for core price calculation.
Findings
Type space information overcomes incentive incompatibility
New auctions improve revenue and fairness
Efficient constraint generation methods developed
Abstract
Core-selecting combinatorial auctions are popular auction designs that constrain prices to eliminate the incentive for any group of bidders -- with the seller -- to renegotiate for a better deal. They help overcome the low-revenue issues of classical combinatorial auctions. We introduce a new class of core-selecting combinatorial auctions that leverage bidder information available to the auction designer. We model such information through constraints on the joint type space of the bidders -- these are constraints on bidders' private valuations that are known to hold by the auction designer before bids are elicited. First, we show that type space information can overcome the well-known impossibility of incentive-compatible core-selecting combinatorial auctions. We present a revised and generalized version of that impossibility result that depends on how much information is conveyed by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAuction Theory and Applications · Consumer Market Behavior and Pricing
