"Note on Combinatorial Auction Design: Efficient Slot Allocation for Domestic Airline Regular Services in Haneda Airport" (in Japanese)
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.
|Date of creation:||Nov 2010|
|Date of revision:|
|Contact details of provider:|| Postal: Hongo 7-3-1, Bunkyo-ku, Tokyo 113-0033|
Web page: http://www.cirje.e.u-tokyo.ac.jp/index.html
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:tky:jseres:2010cj229. 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: (CIRJE administrative office)
If references are entirely missing, you can add them using this form.