Cooperative n-person Prisoner’s Dilemma on a Network

Authors

  • Aleksandra L. Grinikh St. Petersburg State University, 7/9 Universitetskaya nab., Saint Petersburg 199034, Russia
  • Leon A. Petrosyan St. Petersburg State University, 7/9 Universitetskaya nab., Saint Petersburg 199034, Russia

DOI:

https://doi.org/10.21638/11701/spbu31.2021.11

Abstract

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

Downloads

Download data is not yet available.
 

References

Straffin, P. D. (1993). Game Theory and Strategy. The Mathematical Association of America: Washington, 244 p

Hamburger, H. (1973). N-person prisoner's dilemma. Journal of Mathematical Sociology, 3, 27–48

Grinikh, A. L., Petrosyan, L. A. (2021). An effective punishment for an n-person prisoner's dilemma on a network. Trudy Instituta Matematiki i Mekhaniki UrO RAN, 27(3), 256–262

Downloads

Published

2021-10-30

How to Cite

Grinikh, A. L., & Petrosyan, L. A. (2021). Cooperative n-person Prisoner’s Dilemma on a Network. Contributions to Game Theory and Management, 14, 122–126. https://doi.org/10.21638/11701/spbu31.2021.11

Issue

Section

Articles