A Combinatorial Auction with Multiple Winners for Universal Service

We describe a discrete-time auction procedure called PAUSE (Progressive Adaptive User Selection Environment) for use in assigning COLR (Carrier of Last Resort) responsibility for universal service. The auction incorporates synergies by permitting all combinatorial bids, is transparent to the bidders, allows for multiple winners, and minimizes the possibility of bidder collusion. The procedure is computationally tractable for the auctioneer and thus very efficient to run. The inherent computational complexity of combinatorial bidding cannot be eliminated. However, in this auction the computational burden of evaluating synergies rests with the bidders claiming those synergies, while the auctioneer simply checks that a bid is valid.

• 저널Management Science · 46(4) · 586–596
• 토픽Auction Theory and Applications · Management Science and Operations Research
• DOI10.1287/mnsc.46.4.586.12054
• 저자F. P. Kelly, Richard Steinberg