An efficient characterization of some cost allocation solutions associated with capacitated network design problems

We analyze some game-theoretic solution concepts associated with a cost allocation problem arising from the Capacitated Network Design (CND) problem. The problem is formulated as a cost cooperative game in characteristic function form to be referred to as the CND game. We provide an efficient representation of several game-theoretic solution concepts associated with the CND game. In particular, we efficiently characterize the core, and in some cases the nucleolus, the least weightedε-core and a certain “central” point in the least weightedε-core. Our model properly generalizes several previously studied cooperative games. We also employ our model to analyze cost allocation problems associated with several classes of network design problems, which were not previously studied in the literature. Specifically, we efficiently characterize the above cost allocation solutions for cost allocation problems associated with the Capacitated Concentrator Location problem, the Capacitated Minimum Spanning Tree problem, the Capacitated Fixed Cost Spanning Forest problem, and the Capacitated Steiner Tree problem.

[1]  Daniel Granot,et al.  On the core and nucleolus of minimum cost spanning tree games , 1984, Math. Program..

[2]  Theo Driessen.  Cooperative Games and Examples , 1988 .

[3]  Hasan Pirkul,et al.  Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..

[4]  Daniel Granot,et al.  Minimum cost spanning tree games , 1981, Math. Program..

[5]  A. Kolen.  Solving covering problems and the uncapacitated plant location problem on trees , 1983 .

[6]  L. S. Shapley,et al.  Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts , 1979, Math. Oper. Res..

[7]  Bezalel Gavish,et al.  Augmented Lagrangean Based Algorithms for Centralized Network Design , 1985, IEEE Trans. Commun..

[8]  Robert M. Nauss,et al.  An Improved Algorithm for the Capacitated Facility Location Problem , 1978 .

[9]  Darko Skorin-Kapov,et al.  On a cost allocation problem arising from a capacitated concentrator covering problem , 1993, Oper. Res. Lett..

[10]  T. Driessen.  Cooperative Games, Solutions and Applications , 1988 .

[11]  D. Schmeidler.  The Nucleolus of a Characteristic Function Game , 1969 .

[12]  Darko Skorin-Kapov,et al.  On a cost allocation problem arising from a star-star capacitated concentrator location problem , 1994 .

[13]  A. Kopelowitz.  COMPUTATION OF THE KERNELS OF SIMPLE GAMES AND THE NUCLEOLUS OF N-PERSON GAMES. , 1967 .

[14]  Darko Skorin-Kapov.  On the core of the minimum cost steiner tree game in networks , 1995, Ann. Oper. Res..

[15]  Nimrod Megiddo,et al.  Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree , 1978, Math. Oper. Res..

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[18]  S. Littlechild.  A simple expression for the nucleolus in a special case , 1974 .

[19]  C. G. Bird,et al.  On cost allocation for a spanning tree: A game theoretic approach , 1976, Networks.

[20]  A. Charnes,et al.  ON A CLASS OF CONVEX AND NON-ARCHIMEDEAN SOLUTION CONCEPTS FOR N-PERSON GAMES. , 1967 .

[21]  H. Young.  Cost allocation : methods, principles, applications , 1985 .

[22]  Daniel Granot,et al.  Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem , 1992, Math. Oper. Res..

[23]  J. H. Grotte.  Observations on the nucleolus and the central game , 1971 .

[24]  Andranik Mirzaian,et al.  Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds , 1985, Networks.