Geodesic
The dynamic Nash bargaining solution for 2-stage cost sharing game
Contributions to game theory and management, Tome 13 (2020), pp. 296-303.

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

The problem of constructing the Dynamic Nash Bargaining Solution in a 2-stage game is studied. In each stage, a minimum cost spanning tree game is played, all players select strategy profiles to construct graphs in the stage game. At the second stage, players may change the graph using strategy profiles with transition probabilities, which decided by players in the first stage. The players' cooperative behavior is considered. As solution the Dynamic Nash Bargaining Solution is proposed. A theorem is proved to allow the Dynamic Nash Bargaining Solution to be time-consistent.
Keywords: Dynamic Nash Bargaining, dynamic game, minimum cost spanning tree. 
@article{CGTM_2020_13_a14,
     author = {Li Yin},
     title = {The dynamic {Nash} bargaining solution for 2-stage cost sharing game},
     journal = {Contributions to game theory and management},
     pages = {296--303},
     publisher = {mathdoc},
     volume = {13},
     year = {2020},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2020_13_a14/}
}
TY  - JOUR
AU  - Li Yin
TI  - The dynamic Nash bargaining solution for 2-stage cost sharing game
JO  - Contributions to game theory and management
PY  - 2020
SP  - 296
EP  - 303
VL  - 13
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CGTM_2020_13_a14/
LA  - en
ID  - CGTM_2020_13_a14
ER  - 
%0 Journal Article
%A Li Yin
%T The dynamic Nash bargaining solution for 2-stage cost sharing game
%J Contributions to game theory and management
%D 2020
%P 296-303
%V 13
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CGTM_2020_13_a14/
%G en
%F CGTM_2020_13_a14
Li Yin. The dynamic Nash bargaining solution for 2-stage cost sharing game. Contributions to game theory and management, Tome 13 (2020), pp. 296-303. http://geodesic.mathdoc.fr/item/CGTM_2020_13_a14/

[1] Li Yin, “The dynamic Shapley Value in the game with spanning tree”, Stability and Oscillations of Nonlinear Control Systems, 2016 International Conference (Pyatnitskiy's Conference), IEEE, 2016, 1–4

[2] Bird C. G., “On cost allocation for a spanning tree: a game theoretic approach”, Networks, 6:4 (1976), 335–350 | DOI | MR | Zbl

[3] Horn R. A., Johnson C. R., Matrix analysis, Cambridge university press, 2012 | MR

[4] Petrosyan L., “Cooperative stochastic games”, Advances in dynamic games, Birkhauser Boston, 2006 | MR

[5] Junnan J., “Dynamic Nash Bargaining Solution for two-stage network games”, Contributions to Game Theory and Management, 11 (2018), 66–72 | MR

[6] Parilina E. M., “Stable cooperation in stochastic games”, Autom Remote Control, 76, 1111–1122 | DOI | MR

[7] Granot D., Huberman G., “Minimum cost spanning tree games”, Mathematical programming, 21:1 (1981), 1–18 | DOI | MR | Zbl

[8] Petrosyan L. A., “Stability of the Solutions of Differential Games with Several Players”, Vestnik of the Leningrad State University, 19 (1977), 46–52 | MR | Zbl