On a cost allocation problem arising from a capacitated concentrator covering problem

Authors:
Darko Skorin-Kapov
Affiliations:
Harriman School for Management and Policy, State University of New York at Stony Brook, Stony Brook, NY 11794-3775, USA
Venue:
Operations Research Letters
Year:
1993

Citing 2
Cited 1

Efficient algorithms for the capacitated concentrator location problem

Computers and Operations Research
Computational complexity of a cost allocation approach to a fixed cost spanning forest problem

Mathematics of Operations Research

A note on Steiner tree games

Networks

Quantified Score

Hi-index	0.00

Visualization

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 @e-core and the least-weighted @e-core as concepts for fair cost allocation for the CCC problem, and give their efficient characterizations. Certain ''central'' points of the least per capita @e-core and the least weighted @e-core, respectively, are efficiently computed.