Non-manipulability and Pareto-efficiency of DASO rules in Landing Slot Problems

Abstract

We consider the landing slot problem formulated by Schummer and Vohra(2013), which is concerned with reallocating landing slots to airlines in inclement weather. Schummer and Abizada(2016) introduce Deferred Acceptance with Self-Optimization(DASO) rules and show that these rules are individually rational, non-wasteful, non-manipulable via weights, and non-manipulable by slot hiding. However, they are harmfully manipulable by intentional flights delay and not Pareto-efficient. We show that non-harmful-manipulability by intentional flights delay of these rules can be achieved by restricting the priority structure. We also show that they are Pareto-efficient if and only if all flight weights are identical for any given airline.