Dynamic Shapley value in the game with spanning forest

摘要

The dynamic Shapley Value for N-customers and M-suppliers in two-stage minimum cost spanning forest game is considered. Define the players' cooperative behavior. Selecting strategies, players build a minimum cost spanning forest at each stage. At second stage, there is a particular player x ϵ N may drop out of the game. The probability p of the player's leaving depends solely upon all players' behavior in first stage. Along the cooperative trajectory, compute characteristic function value of any coalition. Define the Shapley Value for two-stage and one stage games. According to definition of imputation distribution procedure (IDP), construct the dynamic Shapley Value in the game. An example is proposed.