Cost sharing problems can arise from situations in which some service is provided to a variety of different customers who differ in the amount or type of service they need. One can think of and airports computers, telephones. This paper studies an airport problem which is concerned with the cost sharing of an airstrip between airplanes assuming that one airstrip is sufficient to serve all airplanes. Each airplane needs an airstrip whose length can be different across airplanes. Also, it is important how should the cost of each airstrip be shared among airplanes. The purpose of the present paper is to give an axiomatic characterization of the Baker-Thompson rule by using grey calculus. Further, it is shown that each of our main axioms (population fairness, smallest-cost consistency and balanced population impact) together with various combina tions of our minor axioms characterizes the best-known rule for the problem, namely the Baker-Thompson rule. Finally, it is demonstrated that the grey Shapley value of airport game and the grey Baker-Thompson rule coincides.