"Note on Combinatorial Auction Design: Efficient Slot Allocation for Domestic Airline Regular Services in Haneda Airport" (in Japanese)

Hitoshi Matsushima

No CIRJE-J-229, CIRJE J-Series from CIRJE, Faculty of Economics, University of Tokyo

Abstract: This paper examines how a combinatorial auction format should be designed to allocate the new landing slots that are expected to be available from 2013 for domestic airline regular services in Haneda airport in an efficient manner. In order to make the auction well-behaved, we have to overcome many problems such as incentive, complexity, and privacy. We also examine the possibility to lower the amount of money that airlines pay for the purchase of the slots as much as possible. After explaining the basic concepts in the combinatorial auction literature, this paper proposes a method that is most suitable to solve our slot allocation problem, which is defined as a hybrid of several new concepts such as price-based combinatorial auction and iterative proxy auction.

Pages: 40 pages
Date: 2010-11
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.cirje.e.u-tokyo.ac.jp/research/dp/2010/2010cj229.pdf

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tky:jseres:2010cj229

Access Statistics for this paper

More papers in CIRJE J-Series from CIRJE, Faculty of Economics, University of Tokyo Contact information at EDIRC.
Bibliographic data for series maintained by CIRJE administrative office ().