On a cost allocation problem arising from a Capacitated Concentrator Covering problem

The paper formulates 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 the paper provides an efficient method to find the nucleolus. For the case when the core is empty, it proposes the least per capita •-core and the least weighted •-core as concepts for fair cost allocation for the CCC problem, and gives their efficient characterizations. Certain ‘central’ points of the least per capita •-core and the least weighted •-core, respectively, are efficiently computed.