 Airport problem

Share a runway's cost among users needing different runway lengths. If user $i$ needs a facility costing $C_i\ge 0$, a nonempty coalition pays $c(S)={\max }_{i\in S}{C}_i$, and $c(\varnothing )=0$. This is a subadditive cost game because the maximum of two nonnegative costs does not exceed their sum. A cost-core allocation always exists: charge the whole cost to one longest-runway user and zero to all others. The Shapley value of an airport game gives a symmetric alternative that also lies in the cost core.

The "airport problem" generally refers to a variety of optimization problems related to the operation and management of airports, particularly those involving scheduling, capacity management, and resource allocation. Depending on the context, it can involve several specific issues: 1. **Flight Scheduling**: Determining optimal schedules for arrivals and departures to minimize delays while maximizing the utilization of runways, gates, and other resources.