Geodesic
Cooperative solutions in communication games
Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, no. 4 (2012), pp. 37-45
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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.
Keywords: networks, cooperative games, Shapley value, characteristic function.
Mots-clés : Bellman equation 
@article{VSPUI_2012_4_a3,
     author = {M. I. Karpov and L. A. Petrosyan},
     title = {Cooperative solutions in communication games},
     journal = {Vestnik Sankt-Peterburgskogo universiteta. Prikladna\^a matematika, informatika, processy upravleni\^a},
     pages = {37--45},
     year = {2012},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VSPUI_2012_4_a3/}
}
TY  - JOUR
AU  - M. I. Karpov
AU  - L. A. Petrosyan
TI  - Cooperative solutions in communication games
JO  - Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
PY  - 2012
SP  - 37
EP  - 45
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/VSPUI_2012_4_a3/
LA  - ru
ID  - VSPUI_2012_4_a3
ER  - 
%0 Journal Article
%A M. I. Karpov
%A L. A. Petrosyan
%T Cooperative solutions in communication games
%J Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
%D 2012
%P 37-45
%N 4
%U http://geodesic.mathdoc.fr/item/VSPUI_2012_4_a3/
%G ru
%F VSPUI_2012_4_a3
M. I. Karpov; L. A. Petrosyan. Cooperative solutions in communication games. Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, no. 4 (2012), pp. 37-45. http://geodesic.mathdoc.fr/item/VSPUI_2012_4_a3/

[1] Bellman R. E., Dinamicheskoe programmirovanie, per. s angl. I. M. Andreevoi, Izd-vo inostr. lit., M., 1960, 400 pp. | MR

[2] Karpov M. I., Petrosyan L. A., “Minimizatsiya zatrat v transportnoi seti”, Protsessy upravleniya i ustoichivost, Trudy 42-i mezhdunar. nauch. konferentsii aspirantov i studentov, eds. A. S. Eremin, N. V. Smirnov, Izdat. Dom S.-Peterb. gos. un-ta, SPb., 2011, 508–513

[3] Avrachenkov K., Elias J., Martignon F., Neglia G., Petrosyan L., “A Nash bargaining solution for Cooperative Network Formation Games”, NETWORKING, v. I, LNCS, 6640, 2011, 307–318

[4] Karpov M. I., Petrosyan L. A., “The Game-Theoretical Model of Cost Allocation in Communication Network”, Game Theory and Management, collected abstracts, Graduate School of Management St. Petersburg University, SPb., 2011, 116