TY - JOUR
T1 - How does conformity promote the enhancement of cooperation in the network reciprocity in spatial prisoner's dilemma games?
AU - Ahsan Habib, Md
AU - Tanaka, Masaki
AU - Tanimoto, Jun
N1 - Funding Information:
This study was partially supported by Grant-in-Aid for Scientific Research from JSPS, Japan, KAKENHI (Grant No. JP 19KK0262 and JP 20H02314 ), SCAT (Support Center for Advanced Telecommunications Technology) Research Foundation, and I/O Data Foundation awarded to Professor Tanimoto. We would like to express our gratitude to them.
Funding Information:
This study was partially supported by Grant-in-Aid for Scientific Research from JSPS, Japan, KAKENHI (Grant No. JP 19KK0262 and JP 20H02314), SCAT (Support Center for Advanced Telecommunications Technology) Research Foundation, and I/O Data Foundation awarded to Professor Tanimoto. We would like to express our gratitude to them.
Publisher Copyright:
© 2020
PY - 2020/9
Y1 - 2020/9
N2 - In line with more enhanced network reciprocity, we built a new spatial prisoner's dilemma (SPD) game considering conformity with presumption of lattice for underlying network and pairwise Fermi (PW-Fermi) for update rule. The key protocol is that a neighbor with more weight resulting from the conformity would be more likely selected as a pairwise opponent in the PW-Fermi updating process instead of random selection the conventional model presuming. A series of systematic simulations confirms that our model realizes more enhanced network reciprocity than the conventional SPD model. We elucidated its mechanism by means of considering on the concept of END period (meaning an initial period in which the global-cooperation fraction decreases from its initial value) and EXP periods (meaning the period following to END period in which global-cooperation increases) that substantially explaining how cooperative clusters survive in initial period and extend to defective zones afterwards.
AB - In line with more enhanced network reciprocity, we built a new spatial prisoner's dilemma (SPD) game considering conformity with presumption of lattice for underlying network and pairwise Fermi (PW-Fermi) for update rule. The key protocol is that a neighbor with more weight resulting from the conformity would be more likely selected as a pairwise opponent in the PW-Fermi updating process instead of random selection the conventional model presuming. A series of systematic simulations confirms that our model realizes more enhanced network reciprocity than the conventional SPD model. We elucidated its mechanism by means of considering on the concept of END period (meaning an initial period in which the global-cooperation fraction decreases from its initial value) and EXP periods (meaning the period following to END period in which global-cooperation increases) that substantially explaining how cooperative clusters survive in initial period and extend to defective zones afterwards.
UR - http://www.scopus.com/inward/record.url?scp=85086638210&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85086638210&partnerID=8YFLogxK
U2 - 10.1016/j.chaos.2020.109997
DO - 10.1016/j.chaos.2020.109997
M3 - Article
AN - SCOPUS:85086638210
SN - 0960-0779
VL - 138
JO - Chaos, solitons and fractals
JF - Chaos, solitons and fractals
M1 - 109997
ER -