A Combinatorial Auction Mechanism for Airport Time Slot Allocation
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.
Volume (Year): 13 (1982)
Issue (Month): 2 (Autumn)
|Contact details of provider:|| Web page: http://www.rje.org|
|Order Information:||Web: https://editorialexpress.com/cgi-bin/rje_online.cgi|
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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.