Abstract
We formulate a cost allocation problem arising from a Capacitated Concentrator Covering (CCC) problem as a cooperative game, referred to as the CCC game. An efficient representation of the core of the CCC game is presented. In case of nonemptiness of the core we provide an efficient method to find the nucleolus. For the case when the core is empty, we propose the least per capita ϵ-core and the least-weighted ϵ-core as concepts for fair cost allocation for the CCC problem, and give their efficient characterizations. Certain “central” points of the least per capita ϵ-core and the least weighted ϵ-core, respectively, are efficiently computed.