Cooperative solutions in communication games

The computational algorithm for finding the shortest trajectory connecting some set of initial vertices with some set of terminal vertices is proposed. The trajectory may consist of paths having common edges. The cost of passing through a common edge enters the total cost of trantistion only once. The additional condition that the paths of the players need to contain predefined vertices is introduced. The algorithm built is used to compute the value of a characteristic function of corresponding cooperative game, this lets effectively compute different optimal solutions of cooperative theory. The computational experiment with 26 vertices is held in the research, and the Shapley value for the case with three players is computed.