Assignment of Arrival Slots
نویسندگان
چکیده
Industry participants agree that, when inclement weather forces the FAA to reassign airport landing slots, incentives and property rights should be respected. We show that the FAA’s Compression Algorithm is incentive compatible, but fails to guarantee a form of property rights. This is significant since these conditions were the motivation for introducing Compression a decade ago. We give an alternative mechanism that does satisfy these conditions. It has the flavor of Top-trading Cycle variants of Abdulkadiroğlu and Sönmez (1999) and Papai (2000) for related but distinct models. Finally, both mechanisms may fail another condition: the incentive to vacate unusable landing slots. When inclement weather strikes an airport, the airport’s landing schedule must be reconfigured. First, the allowed arrival rate of flights is reduced, creating a shortage of resources (arrival slots). Even after these slots are reallocated, subsequent flight cancelations and delays, made by airlines themselves, free up some of these slots, resulting in a situation of excess resources (newly vacated landing slots). The efficient reallocation of these excess resources requires airlines to report certain information to a centralized planner (e.g. the Federal Aviation Administration (FAA) in the U.S.), who uses it to arrive at a final reassignment of flights to landing slots. This environment yields a financially significant matching problem that has been studied from an operations and transportation perspective, but has been less studied from the perspective of formal mechanism design.1 ∗Kellogg School of Management, MEDS Department, Northwestern University. Email: [email protected]. †Kellogg School of Management, MEDS Department, Northwestern University. Email: [email protected]. The total cost of delays (wasted fuel, passengers’ time, etc.) is measured in billions of dollars per year (e.g. Robyn (2007) or the report by Senator C. Schumer (2008)). While
منابع مشابه
Matchings in connection with ground delay program planning
In this paper we analyze certain matching problems that arise in ground delay program planning. Ground delay programs are air traffic flow management initiatives put in place when airport arrival demand is expected to exceed arrival capacity for an extended length of time, e.g. 4 hours. Most of the problems we study can be modeled as assignment problems, where flights are assigned to arrival sl...
متن کاملA Novel Mechanism for Contention Resolution in HFC Networks
The Medium Access Control (MAC) scheme proposed by DAVIC/DVB, IEEE 802.14 and DOCSIS for the upstream channel of Hybrid Fiber Coaxial (HFC) access networks is based on a mixable contention-based/contention-less time slot assignment. Contention-less slots are assigned by the head end to end stations according to a reservation scheme. Contentionbased slots are randomly accessed by active terminal...
متن کاملOblivious Assignment with m Slots
Preserving anonymity and privacy of customer actions within a complex software system, such as a cloud computing system, is one of the main issues to be solved in order to boost private computation outsourcing. In this paper, we propose a coordination paradigm, namely oblivious assignment with m slots of a resource R (with m ≥ 1), allowing processes to compete in order to get a slot of R, while...
متن کاملOptimal Bandwidth Allocation With Delayed State Observation and Batch Assignment
In this paper we consider the problem of allocating bandwidth/server to multiple user transmitters/queues with identical but arbitrary arrival processes, to minimize the total expected holding cost of backlogged packets in the system over a finite horizon. The special features of this problem are that (1) packets continuously arrive at these queues regardless of the allocation decision, (2) the...
متن کاملDynamic TDMA Slot Assignment in Ad Hoc Networks
In this paper, we propose a TDMA slot assignment protocol to improve the channel utilization, which controls the excessive increase of unassigned slots by changing the frame length dynamically. Our proposed protocol assigns one of the unassigned slots to a node which joins the network. If there is no unassigned slots available, our proposed protocol generates unassigned slots by depriving one o...
متن کامل