IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v46y2000i4p586-596.html
   My bibliography  Save this article

A Combinatorial Auction with Multiple Winners for Universal Service

Author

Listed:
  • Frank Kelly

    (University of Cambridge, Statistical Laboratory, Cambridge, England CB2 1SB)

  • Richard Steinberg

    (University of Cambridge, The Judge Institute, Cambridge, England CB2 1AG)

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.

Suggested Citation

  • Frank Kelly & Richard Steinberg, 2000. "A Combinatorial Auction with Multiple Winners for Universal Service," Management Science, INFORMS, vol. 46(4), pages 586-596, April.
    • Handle: RePEc:inm:ormnsc:v:46:y:2000:i:4:p:586-596
    DOI: 10.1287/mnsc.46.4.586.12054
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.46.4.586.12054
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.46.4.586.12054?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. B. Douglas Bernheim & Michael D. Whinston, 1986. "Menu Auctions, Resource Allocation, and Economic Influence," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 101(1), pages 1-31.
    2. Nett, Lorenz, 1998. "An alternative approach to allocate universal service obligations," Telecommunications Policy, Elsevier, vol. 22(8), pages 661-669, September.
    3. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    4. Peter Cramton, 1997. "The FCC Spectrum Auctions: An Early Assessment," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 431-495, September.
    5. Klemperer, Paul, 1998. "Auctions with almost common values: The 'Wallet Game' and its applications," European Economic Review, Elsevier, vol. 42(3-5), pages 757-769, May.
    6. Jeffrey S. Banks & John O. Ledyard & David P. Porter, 1989. "Allocating Uncertain and Unresponsive Resources: An Experimental Approach," RAND Journal of Economics, The RAND Corporation, vol. 20(1), pages 1-25, Spring.
    7. R. Preston McAfee & John McMillan, 1996. "Analyzing the Airwaves Auction," Journal of Economic Perspectives, American Economic Association, vol. 10(1), pages 159-175, Winter.
    8. David P. Porter, 1999. "The effect of bid withdrawal in a multi-object auction," Review of Economic Design, Springer;Society for Economic Design, vol. 4(1), pages 73-97.
    9. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    10. John O. Ledyard & David Porter & Antonio Rangel, 1997. "Experiments Testing Multiobject Allocation Mechanisms," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 639-675, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Anthony M. Kwasnica & John O. Ledyard & Dave Porter & Christine DeMartini, 2005. "A New and Improved Design for Multiobject Iterative Auctions," Management Science, INFORMS, vol. 51(3), pages 419-434, March.
    2. Lawrence M. Ausubel & Peter Cramton & Paul Milgrom, 2012. "System and Method for a Hybrid Clock and Proxy Auction," Papers of Peter Cramton 12acmhc, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
    3. Peter Cramton & John McMillan & Paul Milgrom & Bradley Miller & Bridger Mitchell & Daniel Vincent & Robert Wilson, 1997. "Package Bidding for Spectrum Licenses," Papers of Peter Cramton 97cra1b, University of Maryland, Department of Economics - Peter Cramton.
    4. Park, Sunju & Rothkopf, Michael H., 2005. "Auctions with bidder-determined allowable combinations," European Journal of Operational Research, Elsevier, vol. 161(2), pages 399-415, March.
    5. Munro, David R. & Rassenti, Stephen J., 2019. "Combinatorial clock auctions: Price direction and performance," Games and Economic Behavior, Elsevier, vol. 117(C), pages 195-217.
    6. Ausubel Lawrence M & Milgrom Paul R, 2002. "Ascending Auctions with Package Bidding," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-44, August.
    7. Joni L. Jones & Gary J. Koehler, 2005. "A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 475-489, November.
    8. Lawrence M. Ausubel & Peter Cramton & R. Preston McAfee & John McMillan, 1997. "Synergies in Wireless Telephony: Evidence from the Broadband PCS Auctions," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 497-527, September.
    9. Peter Cramton, 2002. "Spectrum Auctions," Papers of Peter Cramton 01hte, University of Maryland, Department of Economics - Peter Cramton, revised 16 Jul 2001.
    10. Lawrence M. Ausubel & Paul Milgrom, 2004. "Ascending Proxy Auctions," Discussion Papers 03-035, Stanford Institute for Economic Policy Research.
    11. Sayee Srinivasan, 2002. "Trading Portfolios Electronically – An Experimental Approach," Netnomics, Springer, vol. 4(1), pages 39-71, March.
    12. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    13. Chernomaz, Kirill & Levin, Dan, 2012. "Efficiency and synergy in a multi-unit auction with and without package bidding: An experimental study," Games and Economic Behavior, Elsevier, vol. 76(2), pages 611-635.
    14. Pallab Sanyal, 2016. "Characteristics and Economic Consequences of Jump Bids in Combinatorial Auctions," Information Systems Research, INFORMS, vol. 27(2), pages 347-364, June.
    15. Kazumori, Eiichiro & Belch, Yaakov, 2019. "t-Tree: The Tokyo toolbox for large-scale combinatorial auction experiments," Journal of Behavioral and Experimental Finance, Elsevier, vol. 24(C).
    16. Ming Fan & Jan Stallaert & Andrew B. Whinston, 2003. "Decentralized Mechanism Design for Supply Chain Organizations Using an Auction Market," Information Systems Research, INFORMS, vol. 14(1), pages 1-22, March.
    17. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    18. Wellman, Michael P. & Walsh, William E. & Wurman, Peter R. & MacKie-Mason, Jeffrey K., 2001. "Auction Protocols for Decentralized Scheduling," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 271-303, April.
    19. Banks, Jeffrey & Olson, Mark & Porter, David & Rassenti, Stephen & Smith, Vernon, 2003. "Theory, experiment and the federal communications commission spectrum auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 51(3), pages 303-350, July.
    20. Anders Lunander & Jan-Eric Nilsson, 2004. "Taking the Lab to the Field: Experimental Tests of Alternative Mechanisms to Procure Multiple Contracts," Journal of Regulatory Economics, Springer, vol. 25(1), pages 39-58, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:46:y:2000:i:4:p:586-596. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.