Geodesic
Multistage networking games with full information
Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 1 (2009) no. 2, pp. 66-81

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

Multistage networking games with full information are considered. The network structure which connects the players is defined at every time moment. We assume that each verge has a utility (the player's profit form the connection with another player), and players have a right to change network structure at every stage. The approach to define optimal players' behavior is proposed.
Keywords: network, networking games, utility, Shapley value, Nash equilibrium. 
@article{MGTA_2009_1_2_a3,
     author = {Leon Petrosjan and Artem Sedakov},
     title = {Multistage networking games with full information},
     journal = {Matemati\v{c}eska\^a teori\^a igr i e\"e prilo\v{z}eni\^a},
     pages = {66--81},
     publisher = {mathdoc},
     volume = {1},
     number = {2},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MGTA_2009_1_2_a3/}
}
TY  - JOUR
AU  - Leon Petrosjan
AU  - Artem Sedakov
TI  - Multistage networking games with full information
JO  - Matematičeskaâ teoriâ igr i eë priloženiâ
PY  - 2009
SP  - 66
EP  - 81
VL  - 1
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MGTA_2009_1_2_a3/
LA  - ru
ID  - MGTA_2009_1_2_a3
ER  - 
%0 Journal Article
%A Leon Petrosjan
%A Artem Sedakov
%T Multistage networking games with full information
%J Matematičeskaâ teoriâ igr i eë priloženiâ
%D 2009
%P 66-81
%V 1
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MGTA_2009_1_2_a3/
%G ru
%F MGTA_2009_1_2_a3
Leon Petrosjan; Artem Sedakov. Multistage networking games with full information. Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 1 (2009) no. 2, pp. 66-81. http://geodesic.mathdoc.fr/item/MGTA_2009_1_2_a3/