Congestion Network Problems and Related Games

This paper analyzes network problems with congestion effects from a cooperative game theoretic perspective. It is shown that for network problems with convex congestion costs, the corresponding games have a non-empty core. If congestion costs are concave, then the corresponding game has not necessarily core elements, but it is derived that, contrary to the convex congestion situation, there always exist optimal tree networks. Extensions of these results to a class of relaxed network problems and associated games are derived.

[1]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[2]  Jeroen Suijs.  Cost allocation in spanning network enterprises with stochastic connection costs , 2003, Games Econ. Behav..

[3]  Daniel J. Kleitman,et al.  Cost allocation for a spanning tree , 1973, Networks.

[4]  Theo Driessen,et al.  A survey on minimum cost spanning tree games , 1991 .

[5]  M. Voorneveld.  Potential games and interactive decisions with multiple criteria , 1999 .

[6]  Vincent Feltkamp,et al.  On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems , 1994 .

[7]  L. Shapley,et al.  Potential Games , 1994 .

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

[9]  Herbert Hamers,et al.  Operations research games: A survey , 2001 .

[10]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[11]  L. Shapley,et al.  REGULAR ARTICLEPotential Games , 1996 .

[12]  Anirban Kar,et al.  Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games , 2002, Games Econ. Behav..

[13]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[14]  Hervé Moulin,et al.  Traffic Based Cost Allocation in Network , 1996 .

[15]  Nobuo Matsubayashi,et al.  A cost allocation problem arising in hub-spoke network systems , 2005, Eur. J. Oper. Res..

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

[17]  Lloyd S. Shapley,et al.  On balanced sets and cores , 1967 .

[18]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[19]  Vincent Feltkamp.  Cooperation in controlled network structures , 1995 .