Advanced Search
MyIDEAS: Login

A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions

Contents:

Author Info

  • Oktay Günlük

    ()
    (IBM Research Division, T. J. Watson Research Center, Yorktown Heights, New York 10598)

  • Lászlo Ladányi

    ()
    (IBM Research Division, T. J. Watson Research Center, Yorktown Heights, New York 10598)

  • Sven de Vries

    ()
    (Zentrum Mathematik, Technische Universität München, Boltzmannstr. 3, D-85747 Garching bei München, Germany)

Registered author(s):

    Abstract

    When combinatorial bidding is permitted in auctions, such as the proposed FCC Auction #31, the resulting full valuations and winner-determination problem can be computationally challenging. We present a branch-and-price algorithm based on a set-packing formulation originally proposed by Dietrich and Forrest (2002, "A column generation approach for combinatorial auctions," in Mathematics of the Internet: E-Auction and Markets. The IMA Volumes in Mathematics and Its Applications, Vol. 127, Springer-Verlag, New York, 15--26). This formulation has a variable for every possible combination of winning bids for each bidder. Our algorithm exploits the structure of the XOR-of-OR bidding language used by the FCC. We also present a new methodology to produce realistic test problems based on the round-by-round results of FCC Auction #4. We generate 2,639 test problems, which involve 99 items and are substantially larger than most of the previously used benchmark problems. Because there are no real-life test problems for combinatorial spectrum auctions with the XOR-of-OR language, we used these test problems to observe the computational behavior of our algorithm. Our algorithm can solve all but one test problem within 10 minutes, appears to be very robust, and for difficult instances compares favorably to the natural formulation solved using a commercial optimization package with default settings. Although spectrum auctions are used as the guiding example to describe the merits of branch and price for combinatorial auctions, our approach applies to auctions of multiple goods in other scenarios similarly.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://dx.doi.org/10.1287/mnsc.1040.0332
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 51 (2005)
    Issue (Month): 3 (March)
    Pages: 391-406

    as in new window
    Handle: RePEc:inm:ormnsc:v:51:y:2005:i:3:p:391-406

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Email:
    Web page: http://www.informs.org/
    More information through EDIRC

    Related research

    Keywords: combinatorial auctions; branch-and-price; spectrum auctions; test problems;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Drexl, Andreas & Jörnsten, Kurt & Knof, Diether, 2005. "Non-linear anonymous pricing in combinatorial auctions," Discussion Papers 2005/6, Department of Business and Management Science, Norwegian School of Economics.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:51:y:2005:i:3:p:391-406. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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