IDEAS home Printed from https://ideas.repec.org/a/rje/bellje/v13y1982iautumnp402-417.html
   My bibliography  Save this article

A Combinatorial Auction Mechanism for Airport Time Slot Allocation

Author

Listed:
  • S.J. Rassenti
  • V.L. Smith
  • R.L. Bulfin

Abstract

A sealed-bid combinatorial auction is developed for the allocation of airport time slots to competing airlines. This auction procedure permits airlines to submit various contingency bids for flight-compatible combinations of individual airport landing or take-off slots. An algorithm for solving the resulting set-packing problem yields an allocation of slots to packages that maximizes the system surplus as revealed by the set of package bids submitted. The algorithm determines individual (slot) resource prices which are used to price packages to the winning bidders at levels guaranteed to be no greater (and normally smaller) than the amounts bid. Laboratory experiments with cash motivated subjects are used to study the efficiency and demand revelation properties of the combinatorial auction in comparison with a proposed independent slot primary auction.

Suggested Citation

  • 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.
    • Handle: RePEc:rje:bellje:v:13:y:1982:i:autumn:p:402-417
    as

    Download full text from publisher

    File URL: http://links.jstor.org/sici?sici=0361-915X%28198223%2913%3A2%3C402%3AACAMFA%3E2.0.CO%3B2-Y&origin=repec
    File Function: full text
    Download Restriction: Access to full text is restricted to JSTOR subscribers. See http://www.jstor.org for details.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:rje:bellje:v:13:y:1982:i:autumn:p:402-417. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: the person in charge (email available below). General contact details of provider: https://www.rje.org .

    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.