A Combinatorial Auction Mechanism for Airport Time Slot Allocation
Vernon Smith and
Bell Journal of Economics, 1982, vol. 13, issue 2, 402-417
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.
References: Add references at CitEc
Citations: View citations in EconPapers (156) Track citations by RSS feed
Downloads: (external link)
http://links.jstor.org/sici?sici=0361-915X%2819822 ... O%3B2-Y&origin=repec full text (application/pdf)
Access to full text is restricted to JSTOR subscribers. See http://www.jstor.org for details.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:rje:bellje:v:13:y:1982:i:autumn:p:402-417
Ordering information: This journal article can be ordered from
https://editorialexp ... i-bin/rje_online.cgi
Access Statistics for this article
More articles in Bell Journal of Economics from The RAND Corporation
Bibliographic data for series maintained by ().