Dynamic Cost-Sharing Game with Spanning Arborescence

Standard

Dynamic Cost-Sharing Game with Spanning Arborescence. / Ye, Peichen ; Li, Yin ; Petrosian, Ovanes .

в: Contributions to Game Theory and Management, Том 15, 2022, стр. 287-302.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

BibTeX

@article{6a7b2a868620485ea011ab686bcd72f8,

title = "Dynamic Cost-Sharing Game with Spanning Arborescence",

abstract = "This paper presents the dynamic Shapley value for cost-sharing game with spanning arborescence. The cooperative behaviour of players is determined, and a two-stage directed network game is considered. At each stage, a cost matrix associated with the directed network is defined by players adopting strategies, and a minimum cost spanning arborescence on the directed network is determined. After the first stage, a particular player will leave the game with a certain probability, which depends on all players' behaviours in the first stage. The characteristic function is defined. Using the Imputation Distribution Procedure(IDP), the dynamic Shapley value in the game is constructed.",

keywords = "directed network, cost sharing game, minimum cost spanning arborescences, dynamic Shapley value",

author = "Peichen Ye and Yin Li and Ovanes Petrosian",

note = "Ye, P., Li, Y., & Petrosian, O. (2023). Dynamic Cost-Sharing Game with Spanning Arborescence. Contributions to Game Theory and Management, 15, 287-302. Retrieved from ttps://gametheory.spbu.ru/article/view/15262",

year = "2022",

language = "English",

volume = "15",

pages = "287--302",

journal = "Contributions to Game Theory and Management",

issn = "2310-2608",

}

RIS

TY - JOUR

T1 - Dynamic Cost-Sharing Game with Spanning Arborescence

AU - Ye, Peichen

AU - Li, Yin

AU - Petrosian, Ovanes

N1 - Ye, P., Li, Y., & Petrosian, O. (2023). Dynamic Cost-Sharing Game with Spanning Arborescence. Contributions to Game Theory and Management, 15, 287-302. Retrieved from ttps://gametheory.spbu.ru/article/view/15262

PY - 2022

Y1 - 2022

N2 - This paper presents the dynamic Shapley value for cost-sharing game with spanning arborescence. The cooperative behaviour of players is determined, and a two-stage directed network game is considered. At each stage, a cost matrix associated with the directed network is defined by players adopting strategies, and a minimum cost spanning arborescence on the directed network is determined. After the first stage, a particular player will leave the game with a certain probability, which depends on all players' behaviours in the first stage. The characteristic function is defined. Using the Imputation Distribution Procedure(IDP), the dynamic Shapley value in the game is constructed.

AB - This paper presents the dynamic Shapley value for cost-sharing game with spanning arborescence. The cooperative behaviour of players is determined, and a two-stage directed network game is considered. At each stage, a cost matrix associated with the directed network is defined by players adopting strategies, and a minimum cost spanning arborescence on the directed network is determined. After the first stage, a particular player will leave the game with a certain probability, which depends on all players' behaviours in the first stage. The characteristic function is defined. Using the Imputation Distribution Procedure(IDP), the dynamic Shapley value in the game is constructed.

KW - directed network

KW - cost sharing game

KW - minimum cost spanning arborescences

KW - dynamic Shapley value

UR - https://www.mathnet.ru/links/78d96e57a423dff1dd4ce258f0471c9d/cgtm430.pdf

M3 - Article

VL - 15

SP - 287

EP - 302

JO - Contributions to Game Theory and Management

JF - Contributions to Game Theory and Management

SN - 2310-2608

ER -

ID: 104188229

Standard

Harvard

APA

Vancouver

Author

BibTeX

RIS