Geodesic
Two-level cooperative game on hypergraph
Contributions to game theory and management, Tome 14 (2021), pp. 227-235.

Voir la notice de l'article provenant de la source Math-Net.Ru

In the paper, the cooperative game with a hypergraph communication structure is considered. For this class of games, a new allocation rule was proposed by splitting the original game into a game between hyperlinks and games within them. The communication possibilities are described by the hypergraph in which the nodes are players and hyperlinks are the communicating subgroups of players. The game between hyperlinks and between players in each hyperlink is described. The payoff of each player is influenced by the actions of other players dependent on the distance between them on hypergraph. Constructed characteristic functions based on cooperative behaviour satisfy the convexity property. The results are shown by the example.
Keywords: cooperation, characteristic function, hypergraph, communication structure. 
@article{CGTM_2021_14_a17,
     author = {David A. Kosian and Leon A. Petrosyan},
     title = {Two-level cooperative game on hypergraph},
     journal = {Contributions to game theory and management},
     pages = {227--235},
     publisher = {mathdoc},
     volume = {14},
     year = {2021},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2021_14_a17/}
}
TY  - JOUR
AU  - David A. Kosian
AU  - Leon A. Petrosyan
TI  - Two-level cooperative game on hypergraph
JO  - Contributions to game theory and management
PY  - 2021
SP  - 227
EP  - 235
VL  - 14
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CGTM_2021_14_a17/
LA  - en
ID  - CGTM_2021_14_a17
ER  - 
%0 Journal Article
%A David A. Kosian
%A Leon A. Petrosyan
%T Two-level cooperative game on hypergraph
%J Contributions to game theory and management
%D 2021
%P 227-235
%V 14
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CGTM_2021_14_a17/
%G en
%F CGTM_2021_14_a17
David A. Kosian; Leon A. Petrosyan. Two-level cooperative game on hypergraph. Contributions to game theory and management, Tome 14 (2021), pp. 227-235. http://geodesic.mathdoc.fr/item/CGTM_2021_14_a17/

[1] Myerson R. B., “Graphs and cooperation in games”, Math. Oper. Res., 2 (1977), 225–229 | MR | Zbl

[2] Shapley L. S., “A value for n-person games”, Annals of Math. Studies, 28 (1953), 307–317 | MR | Zbl

[3] Owen G., “Values of graph-restricted games”, SIAM J. Alg. Disc. Meth., 7 (1986), 210–220 | MR | Zbl

[4] Meessen R., Communication games, Master's thesis, Department of Mathematics. University of Nijmegen, the Netherlands, 1988 (in Dutch)

[5] van den Nouweland A., Borm P., Tijs S., “Allocation rules for hypergraph communication situations”, Int. J. Game Theory, 20 (1992), 255–268 | MR | Zbl

[6] Shan E., G. Zhang, X. Shan, “The degree value for games with communication structure”, Int. J. Game Theory, 47 (2018), 857–871 | MR | Zbl

[7] Von Neumann J., Morgenstern O., Theory of Games and Economic Behavior, Princeton University Press, Princeton, 1994 | MR

[8] Bulgakova M. A., Petrosyan L. A., “About one multistage non-antagonistic network game”, Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 15:4 (2019), 603–615 (in Russian) | MR

[9] Tur A., Petrosyan L., “Strong Time-Consistent Solution for Cooperative Differential Games with Network Structure”, Mathematics, 9 (2021), 755 | DOI