Skip to main content Accessibility help
×
Hostname: page-component-8448b6f56d-mp689 Total loading time: 0 Render date: 2024-04-19T23:51:23.543Z Has data issue: false hasContentIssue false

18 - A Combinatorial Auction Mechanism for Airport Time Slot Allocation

from Part III - Alternative Auction Designs

Published online by Cambridge University Press:  26 October 2017

Stephen J. Rassenti
Affiliation:
Economic Science Institute, Chapman University
Vernon L. Smith
Affiliation:
Economic Science Institute, Chapman University
Robert L. Bulfin
Affiliation:
Department of Industrial and Systems Engineering, Auburn University
Martin Bichler
Affiliation:
Technische Universität München
Jacob K. Goeree
Affiliation:
University of New South Wales, Sydney
Get access

Summary

The Problem of Allocating Airport Slots

In 1968 the FAA adopted a high density rule for the allocation of scarce landing and take-off slots at four major airports (La Guardia,Washington National, Kennedy International, and O'Hare International). This rule establishes slot quotas for the control of airspace congestion at these airports.

Airport runway slots, regulated by these quotas, have a distinguishing feature which any proposed allocation procedure must accommodate: an airline's demand for a takeoff slot at a flight originating airport is not independent of its demand for a landing slot at the flight destination airport. Indeed, a given flight may take off and land in a sequence of several connected demand interdependent legs. For economic efficiency it is desirable to develop an airport slot allocation procedure that allocates individual slots to those airline flights for which the demand (willingness to pay) is greatest.

Grether, Isaac, and Plott (hereafter, GIP) (1979, 1981) have proposed a practical market procedure for achieving this goal. Their procedure is based upon the growing body of experimental evidence on the performance of (1) the competitive (uniform price) sealed-bid auction and (2) the oral double auction such as is used on the organized stock and commodity exchanges. Under their proposal an independent primary market for slots at each airport would be organized as a sealed-bid competitive auction at timely intervals. Since the primary market allocation does not make provision for slot demand interdependence, a computerized form of the oral double auction (with block transaction capabilities) is proposed as an “after market” to allow airlines to purchase freely and sell primary market slots to each other. This continuous after market exchange would provide the institutional means by which individual airlines would acquire those slot packages which support their individual flight schedules. Thus, an airline that acquired slots at Washington National which did not flight-match the slots acquired at O'Hare could either buy additional O'Hare slots or sell its excess Washington slots in the after market.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Grether, D., Isaac, M., and Plott, C. “Alternative Methods of Allocating Airport Slots: Performance and Evaluation.” CAB Report. Pasadena, Calif.: Polynomics Research Laboratories I.c., 1979.
Grether, D., Isaac, M., and Plott, C. “The Allocation of Landing Rights by Unanimity among Competitors.” AmericanEconomic Review, Vol. 71 (May 1981), pp. 166–171.
Rassenti, S. “0–1 Decision Problems with Multiple Resource Constraints: Algorithms and Applications.” Unpublished Ph.D. thesis, University of Arizona, 1981.
Smith, V. “Experimental Economics: Induced Value Theory.” American Economic Review, Vol. 66 (May 1976).
Vickrey, W. “Counterspeculation, Auctions, and Competitive Sealed Tenders.” Journal of Finance (March 1961).
“Midway Air Sets Chicago-Dallas Ticket at $89.” Wall Street Journal (May 17, 1982), pp. 1, 4.
Wolsey, L. “Integer Programming Duality: Price Functions and Sensitivity Analysis.” MathematicalProgramming, Vol. 20 (1981), pp. 173–195.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×