Strong time-consistent solution for cooperative differential games with network structure

Standard

Strong time-consistent solution for cooperative differential games with network structure. / Tur, Anna ; Petrosyan, Leon.

In: Mathematics, Vol. 9, No. 7, 755, 01.04.2021.

Research output: Contribution to journal › Article › peer-review

BibTeX

@article{06d612e05b4b452fa92211982803cee3,

title = "Strong time-consistent solution for cooperative differential games with network structure",

abstract = "One class of cooperative differential games on networks is considered. It is assumed that interaction on the network is possible not only between neighboring players, but also between players connected by paths. Various cooperative optimality principles and their properties for such games are investigated. The construction of the characteristic function is proposed, taking into account the network structure of the game and the ability of players to cut off connections. The conditions under which a strong time-consistent subcore is not empty are studied. The formula for explicit calculation of the Shapley value is derived. The results are illustrated by the example of one differential marketing game.",

keywords = "Cooperative game, Core, Differential game, Network, Shapley value, Strong time-consistent subcore, core, shapley value, cooperative game, strong time-consistent subcore, differential game, network",

author = "Anna Tur and Leon Petrosyan",

year = "2021",

month = apr,

day = "1",

doi = "10.3390/math9070755",

language = "English",

volume = "9",

journal = "Mathematics",

issn = "2227-7390",

publisher = "MDPI AG",

number = "7",

}

RIS

TY - JOUR

T1 - Strong time-consistent solution for cooperative differential games with network structure

AU - Tur, Anna

AU - Petrosyan, Leon

PY - 2021/4/1

Y1 - 2021/4/1

N2 - One class of cooperative differential games on networks is considered. It is assumed that interaction on the network is possible not only between neighboring players, but also between players connected by paths. Various cooperative optimality principles and their properties for such games are investigated. The construction of the characteristic function is proposed, taking into account the network structure of the game and the ability of players to cut off connections. The conditions under which a strong time-consistent subcore is not empty are studied. The formula for explicit calculation of the Shapley value is derived. The results are illustrated by the example of one differential marketing game.

AB - One class of cooperative differential games on networks is considered. It is assumed that interaction on the network is possible not only between neighboring players, but also between players connected by paths. Various cooperative optimality principles and their properties for such games are investigated. The construction of the characteristic function is proposed, taking into account the network structure of the game and the ability of players to cut off connections. The conditions under which a strong time-consistent subcore is not empty are studied. The formula for explicit calculation of the Shapley value is derived. The results are illustrated by the example of one differential marketing game.

KW - Cooperative game

KW - Core

KW - Differential game

KW - Network

KW - Shapley value

KW - Strong time-consistent subcore

KW - core

KW - shapley value

KW - cooperative game

KW - strong time-consistent subcore

KW - differential game

KW - network

UR - http://www.scopus.com/inward/record.url?scp=85104061502&partnerID=8YFLogxK

U2 - 10.3390/math9070755

DO - 10.3390/math9070755

M3 - Article

AN - SCOPUS:85104061502

VL - 9

JO - Mathematics

JF - Mathematics

SN - 2227-7390

IS - 7

M1 - 755

ER -

ID: 76959487