A Combinatorial Auction with Multiple Winners for Universal Service
提出一种名为PAUSE的离散时间拍卖程序，用于分配普遍服务中的最后运营商责任。该拍卖允许组合投标、支持多个赢家、减少串谋可能，且计算高效，适合拍卖师运行。
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.