On transportation network game

The $n$-person transportation game over a Network $G(X,D)$ is considered. The players at the beginning are situated in the vertexes $x(N)\in X$ of the Network $G$. The aim of each player is to reach a fixed vertex $a\in X$ with minimal costs. The additional condition is that the paths of players must not intersect (must not contain the same arcs). The rich family of Nash Equilibrium points is constructed and the cooperative game is also considered. Two different approaches to the definition of characteristic function are proposed.