TY - JOUR

T1 - The Dynamic Nash Bargaining Solution for 2-Stage Cost Sharing Game.

AU - Li, Yin

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

KW - dynamic game

KW - Dynamic Nash Bargaining

KW - Minimum cost spanning tree

KW - dynamic game

KW - Dynamic Nash Bargaining

KW - Minimum cost spanning tree

M3 - Article

VL - 13

SP - 296

EP - 303

JO - Contributions to Game Theory and Management

JF - Contributions to Game Theory and Management

SN - 2310-2608

ER -