Work

The Optimal Competitive Ratio for Subadditive Online Combinatorial Auctions is Less Than 1/2

Year: 2026
Type: preprint
Abstract: We construct a four-buyer online combinatorial auction with independent subadditive valuations and a fixed, known arrival order in which every online rule earns strictly less than $1/2$ of the expected offline optimum. A common partition, revealed at the third arrival, gives the first three buyers one unit of welfare per item. If the rule uses three distinct partitions, either an item allocated early contributes zero or the fourth buyer's expected value for the remaining bundle is one less than its size. We compute the optimal online and offline welfare exactly and show that a $1/2$ guarantee always holds with at most three buyers.
Language: English
Open Access status: green
OpenAlex ID: W7236806325
Cites:
Cited by:
Related to: 10