| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
|
|
|
|||||||
|
|||||||||
University of Cambridge, Statistical Laboratory, Cambridge, England CB2 1SB
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.
University of Cambridge, The Judge Institute, Cambridge, England CB2 1AG
f.p.kelly{at}statslab.cam.ac.uk
r.steinberg{at}jims.cam.ac.uk
This article has been cited by other articles:
|
|
 |
|
  R. L.-Y. Chen, S. AhmadBeygi, A. Cohn, D. R. Beil, and A. Sinha Solving Truckload Procurement Auctions Over an Exponential Number of Bundles Transportation Science, November 1, 2009; 43(4): 493 - 510. [Abstract] [PDF]
|
|
|
|
 |
|
 M. Bichler, P. Shabalin, and A. Pikovsky A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats Information Systems Research, March 1, 2009; 20(1): 33 - 59. [Abstract] [PDF]
|
|
|
|
 |
|
 T. Sandholm, D. Levine, M. Concordia, P. Martyn, R. Hughes, J. Jacobs, and D. Begg Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization Interfaces, January 1, 2006; 36(1): 55 - 68. [Abstract] [PDF]
|
|
|
|
|
|
G. Adomavicius and A. Gupta Toward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions Information Systems Research, June 1, 2005; 16(2): 169 - 185. [Abstract] [PDF]
|
|
|
|
 |
|
 G. Anandalingam, R. W. Day, and S. Raghavan The Landscape of Electronic Market Design Management Science, March 1, 2005; 51(3): 316 - 327. [Abstract] [PDF]
|
|
|
|
|
|
T. Sandholm, S. Suri, A. Gilpin, and D. Levine CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions Management Science, March 1, 2005; 51(3): 374 - 390. [Abstract] [PDF]
|
|
|
|
|
|
R. H. Kwon, G. Anandalingam, and L. H. Ungar Iterative Combinatorial Auctions with Bidder-Determined Combinations Management Science, March 1, 2005; 51(3): 407 - 418. [Abstract] [PDF]
|
|
|
|
|
|
J. Gallien and L. M. Wein A Smart Market for Industrial Procurement with Capacity Constraints Management Science, January 1, 2005; 51(1): 76 - 91. [Abstract] [PDF]
|
|
|
|
|
|
R. D. Banker and R. J. Kauffman 50th Anniversary Article: The Evolution of Research on Information Systems: A Fiftieth-Year Survey of the Literature in Management Science Management Science, March 1, 2004; 50(3): 281 - 298. [Abstract] [PDF]
|
|
|
|
|
|
A. Pekec and M. H. Rothkopf Combinatorial Auction Design Management Science, November 1, 2003; 49(11): 1485 - 1503. [Abstract] [PDF]
|
|
|
|
|
|
D. R. Beil and L. M. Wein An Inverse-Optimization-Based Auction Mechanism to Support a Multiattribute RFQ Process Management Science, November 1, 2003; 49(11): 1529 - 1545. [Abstract] [PDF]
|
|
|
|
 |
|
 S. de Vries and R. V. Vohra Combinatorial Auctions: A Survey INFORMS Journal on Computing, January 1, 2003; 15(3): 284 - 309. [Abstract] [PDF]
|
|
|
|
|
|
R. Epstein, L. Henriquez, J. Catalan, G. Y. Weintraub, and C. Martinez A Combinational Auction Improves School Meals in Chile Interfaces, November 1, 2002; 32(6): 1 - 14. [Abstract] [PDF]
|
|
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
