Allocation of Airport Flight Slots Using a Vickrey-Clarke-Groves Auction with Game Theory
摘要
Airport slot allocation is a significant procedure with a number of benefits that emerge for the airport itself but for the airlines as well. Market-based approaches have gained interest to address slot allocation since the airlines are essentially bidders that compete for the slots. Market-based approaches have significant benefits over other methods including efficiency. In this paper, the slot allocation of airports is addressed using the Vickrey-Clark-Groves (VCG) auction model. The auction is implemented to impose a constraint to the allocation process by allowing acquisition of one slot per airline. Moreover, we provide a coalitional game theoretic algorithm to solve the VCG model. Results show the best possible slot allocation, and further research is essential to describe the multiple slots’ acquisition and whether this takes place due to unwanted behavior of the airline in its bidding process. Furthermore in the results, different values are noticed which essentially is attributed to the different models of solving the slot allocation problem.