Abstract
We discuss a novel approach for reducing a k-item n-bidder auction with additive valuation to k-item 1-bidder auctions, leading to applications such as constant factor approximation algorithms, and Bayesian versus dominant-strategy ratio bounds. We also discuss auctions that have non-additive valuations.