|
Эта публикация цитируется в 2 научных статьях (всего в 2 статьях)
New characteristic function for two stage games with spanning tree
Min Chenga, Yin Liab a St. Petersburg State University, 7/9 Universitetskaya nab., Saint Petersburg, 199034, Russia
b School of Economics and Management, Yanan University, Yan'an, 716000, China
Аннотация:
Two-stage $n$-player games with spanning tree are considered. The cooperative behaviour of players is defined. After the first stage, a specified player leaves the game with a probability that depends on the actions of all players in the first stage. A new approach to the construction of the characteristic function is proposed. In the game, all players are connected with the source directly or indirectly. Assume that the players in coalition $N\setminus S$ have already connected to the source when the players in coalition $S\subset N$ wish to connect to the source. The players in coalition $S$ could connect to the source with the help of the players in coalition $N\setminus S$. A new characteristic function is defined in the game, and the Shapley value is constructed. Several results based on the new characteristic function in the two-stage stochastic game are given.
Ключевые слова:
dynamic game, minimum cost spanning tree, Shapley value.
Образец цитирования:
Min Cheng, Yin Li, “New characteristic function for two stage games with spanning tree”, Contributions to Game Theory and Management, 14 (2021), 59–71
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/cgtm387 https://www.mathnet.ru/rus/cgtm/v14/p59
|
|