Cooperative $n$-person prisoner's dilemma on a network
Contributions to game theory and management, Tome 14 (2021), pp. 122-126
Cet article a éte moissonné depuis la source Math-Net.Ru
In the paper $n$-person prisoner's dilemma on the network is investigated. A cooperative game with the pairwise interaction of players is constructed. The model is a modification of the classic 2-person prisoner's dilemma problem in the game theory. Network interaction provide an ability to take into account the influence only to the adjacent players from the whole set of players. The feature of the game is found that allows to make a decision about necessity of playing dominated strategy by a few players. This solution is based on the number of the adjacent players. The work is a continuation of the paper published earlier by Grinikh A.L. and Petrosyan L.A. in 2021.
Keywords:
pairwise interaction, cooperative game, prisoner's dilemma.
@article{CGTM_2021_14_a11,
author = {Aleksandra L. Grinikh and Leon A. Petrosyan},
title = {Cooperative $n$-person prisoner's dilemma on a network},
journal = {Contributions to game theory and management},
pages = {122--126},
year = {2021},
volume = {14},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CGTM_2021_14_a11/}
}
Aleksandra L. Grinikh; Leon A. Petrosyan. Cooperative $n$-person prisoner's dilemma on a network. Contributions to game theory and management, Tome 14 (2021), pp. 122-126. http://geodesic.mathdoc.fr/item/CGTM_2021_14_a11/
[1] Straffin P. D., Game Theory and Strategy, The Mathematical Association of America, Washington, 1993, 244 pp. | MR | Zbl
[2] Hamburger H., “N-person prisoner's dilemma”, Journal of Mathematical Sociology, 3 (1973), 27–48 | MR | Zbl
[3] Grinikh A. L., Petrosyan L. A., “An effective punishment for an n-person prisoner's dilemma on a network”, Trudy Instituta Matematiki i Mekhaniki UrO RAN, 27, no. 3, 2021, 256–262 | MR