Generalization Guarantees for Multi-Item Profit Maximization: Pricing, Auctions, and Randomized Mechanisms: (d,t)-Delineable Classes Have Generalization Guarantee 120U√(9d ln(4dt)/N) + 4U√(2ln(4/δ)/N)Research Paper
A seller who knows the distribution of buyers' values can, in principle, compute a profit-maximizing mechanism. In practice the seller has data: past bids, or past purchases. Sample-based mechanism design picks a mechanism from a parameterized class using samples from the unknown distribution. The output is only useful if profit on the samples predicts…