General Airport Slot Allocation Problems

We analyze multi-runway airport slot allocation problems during adverse weather. The number of slots assigned in any time interval is the same across feasible and non-wasteful landing schedules. The structure of the set of assigned slots is more complex than its counterpart in the single-runway problems, and we found that single-runway algorithms fail to identify uncontested slots. By employing a new algorithm, we identify the number of uncontested slots in each time interval. We propose a class of mechanisms that respect property rights over slots and are able to assign some uncontested slots at trivial prices