An effective package bidding mechanism addresses three problems: the exposure problem (the risks a bidder faces in trying to construct an efficiently large combination of licenses), the free-rider problem (the difficulties small bidders have in beating those who bid for larger packages of licenses), and the computational complexity problem (which arises from the fact that the number of possible combinations of licenses is much larger than the number of licenses). Package bidding offers the possibility of an improvement over individual-license bidding only when there are strong complementarities and the pattern of those complementarities varies across bidders. Package bidding works satisfactorily only when the auction rules have been carefully designed to manage all three problems.