= Airport problem
{wiki}
= Airport game
{synonym}
Share a runway's cost among users needing different runway lengths. If user $i$ needs a facility costing $C_i\geq0$, 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>.
Back to article page
