Standard

Two-Level Cooperation in Network Games. / Петросян, Леон Аганесович; Седаков, Артем Александрович.

In: Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, Vol. 277, 01.01.2019, p. 71-81.

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

Harvard

Петросян, ЛА & Седаков, АА 2019, 'Two-Level Cooperation in Network Games', Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, vol. 277, pp. 71-81. https://doi.org/10.1007/978-3-030-16989-3_5

APA

Петросян, Л. А., & Седаков, А. А. (2019). Two-Level Cooperation in Network Games. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, 277, 71-81. https://doi.org/10.1007/978-3-030-16989-3_5

Vancouver

Петросян ЛА, Седаков АА. Two-Level Cooperation in Network Games. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. 2019 Jan 1;277:71-81. https://doi.org/10.1007/978-3-030-16989-3_5

Author

Петросян, Леон Аганесович ; Седаков, Артем Александрович. / Two-Level Cooperation in Network Games. In: Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. 2019 ; Vol. 277. pp. 71-81.

BibTeX

@article{247f8607b9fc498d9e4e5d868b65fea3,
title = "Two-Level Cooperation in Network Games",
abstract = "The problem of allocating a value in hierarchical cooperative structures is important in the game theoretic literature, and it often arises in practice. In this paper, we consider a two-level structure of players communication and propose a procedure allocating the value in two steps: first the value is allocated at the upper level among groups of players, and then each group allocates the designated value among its members. We demonstrate how to allocate the value in two steps using the Shapley value and show the difference with the classical one-step allocation procedure. We then adopt this approach for games with pairwise interactions and provide relations between several definitions of the characteristic function and the corresponding Shapley values.",
keywords = "Cooperation, Hierarchy, Network, Shapley value, Two-level allocation",
author = "Петросян, {Леон Аганесович} and Седаков, {Артем Александрович}",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-16989-3_5",
language = "English",
volume = "277",
pages = "71--81",
journal = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST",
issn = "1867-8211",
publisher = "Springer Nature",

}

RIS

TY - JOUR

T1 - Two-Level Cooperation in Network Games

AU - Петросян, Леон Аганесович

AU - Седаков, Артем Александрович

PY - 2019/1/1

Y1 - 2019/1/1

N2 - The problem of allocating a value in hierarchical cooperative structures is important in the game theoretic literature, and it often arises in practice. In this paper, we consider a two-level structure of players communication and propose a procedure allocating the value in two steps: first the value is allocated at the upper level among groups of players, and then each group allocates the designated value among its members. We demonstrate how to allocate the value in two steps using the Shapley value and show the difference with the classical one-step allocation procedure. We then adopt this approach for games with pairwise interactions and provide relations between several definitions of the characteristic function and the corresponding Shapley values.

AB - The problem of allocating a value in hierarchical cooperative structures is important in the game theoretic literature, and it often arises in practice. In this paper, we consider a two-level structure of players communication and propose a procedure allocating the value in two steps: first the value is allocated at the upper level among groups of players, and then each group allocates the designated value among its members. We demonstrate how to allocate the value in two steps using the Shapley value and show the difference with the classical one-step allocation procedure. We then adopt this approach for games with pairwise interactions and provide relations between several definitions of the characteristic function and the corresponding Shapley values.

KW - Cooperation

KW - Hierarchy

KW - Network

KW - Shapley value

KW - Two-level allocation

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

UR - http://www.mendeley.com/research/twolevel-cooperation-network-games

U2 - 10.1007/978-3-030-16989-3_5

DO - 10.1007/978-3-030-16989-3_5

M3 - Article

VL - 277

SP - 71

EP - 81

JO - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

JF - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

SN - 1867-8211

ER -

ID: 41129681