Geodesic
On transportation network game
Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 3 (2011) no. 4, pp. 89-98.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: network games, cooperative games
Mots-clés : transportation model, Bellman equation. 
@article{MGTA_2011_3_4_a3,
     author = {Leon A. Petrosyan},
     title = {On transportation network game},
     journal = {Matemati\v{c}eska\^a teori\^a igr i e\"e prilo\v{z}eni\^a},
     pages = {89--98},
     publisher = {mathdoc},
     volume = {3},
     number = {4},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MGTA_2011_3_4_a3/}
}
TY  - JOUR
AU  - Leon A. Petrosyan
TI  - On transportation network game
JO  - Matematičeskaâ teoriâ igr i eë priloženiâ
PY  - 2011
SP  - 89
EP  - 98
VL  - 3
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MGTA_2011_3_4_a3/
LA  - ru
ID  - MGTA_2011_3_4_a3
ER  - 
%0 Journal Article
%A Leon A. Petrosyan
%T On transportation network game
%J Matematičeskaâ teoriâ igr i eë priloženiâ
%D 2011
%P 89-98
%V 3
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MGTA_2011_3_4_a3/
%G ru
%F MGTA_2011_3_4_a3
Leon A. Petrosyan. On transportation network game. Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 3 (2011) no. 4, pp. 89-98. http://geodesic.mathdoc.fr/item/MGTA_2011_3_4_a3/

[1] Bellman R. E., Dinamicheskoe programmirovanie, IL, M., 1960 | MR

[2] Zenkevich N. A., Petrosyan L. A., Yang D. V. K., Dinamicheskie igry i ikh primeneniya v menedzhmente, Vysshaya shkola menedzhmenta, SPb., 2009

[3] Korbut A. A., Finkelshtein Yu. Yu., Diskretnoe programmirovanie, Nauka, M., 1969 | MR | Zbl

[4] Pecherskii S. L., Yanovskaya E. B., Kooperativnye igry: resheniya i aksiomy, Izd-vo Evrop. Un-ta v S. Peterburge, SPb., 2004

[5] Bellman R. E., “On a routing problem”, Quart. Appl. Math., 16 (1958), 87–90 | MR | Zbl

[6] Hu T. C., Integer programming and network flow, Addison-Wesley, Boston, 1969 | MR