A combinatorial auction with multiple winners for universal service

A combinatorial auction with multiple winners for universal service

0.00 Avg rating0 Votes
Article ID: iaor20011606
Country: United States
Volume: 46
Issue: 4
Start Page Number: 586
End Page Number: 596
Publication Date: Apr 2000
Journal: Management Science
Authors: ,
Keywords: communication, combinatorial analysis
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.