A Combinatorial Auction Mechanism for Airport Time Slot Allocation
AbstractA 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.
Download InfoIf 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.
Bibliographic InfoArticle provided by The RAND Corporation in its journal Bell Journal of Economics.
Volume (Year): 13 (1982)
Issue (Month): 2 (Autumn)
Contact details of provider:
Web page: http://www.rje.org
You can help add them by filling out this form.
Blog mentionsAs found by EconAcademics.org, the blog aggregator for Economics research:CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statistics
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.