Prisoners’ dilemma is a typical game theory issue. In this study, it was treated as an incomplete information game to establish a related machine learning model using a naive Bayesian classification method. The model established was referred to as the Bayes model. Using this model, the incomplete information game was soluble with the assistance of statistical machine learning. This study proceeded as follows: firstly, four typical models were run against the Bayes model some 10,000 times. The total incomes of the models recorded suggested that Bayes model was more advantageous than other models. Even in a multi-player prisoners’ game, Bayes model also presented the desired level of performance and accrued a higher income than other models. Further statistical analysis implied that the Bayes model and the widely accepted optimum strategy tit-for-tat (TFT) model showed a tendency to be prone to defection. Secondly, according to the games run on the natural Bayes model, as well as the natural TFT model, it was found that the Bayes model accrued more benefits than the TFT model on average. Finally, comparison of the Bayes model with the TFT model revealed that the Bayes model was better. This demonstrated the efficacy of the Bayes model constructed in this study and moreover, provided a novel idea for solving the problem of an incomplete information game.
목차
Abstract 1. Introduction 2. Construction of the Model 2.1. Prisoners’ Dilemma Model 2.2. Typical Strategy Models 2.3. The Bayes Model 2.4. The Multi-player Prisoners’ Dilemma Model 2.5. Strategy in the Multi-player Prisoners’ Dilemma based on Statistical Machine Learning 2.6. Evaluation of the Strategy Model 3. Experimental Results and Analysis 3.1. The Performance of the Double-player Strategy Model: Naive Bayesian Classification 3.2. The Performance of the Multi-player Bayes Model 3.3. Analysis of the Performance of the Bayes Model versus Common Models 3.4. The Performance of the Bayes Model when Run over Fewer Games 3.5. The Game Results from a PTFT Model Compared with the Other Models 4. Conclusions Acknowledgements References
키워드
gameprisoners’ dilemmamachine learningBayesian algorithmincomplete information game
저자
Xiuqin Deng [ School of Applied Mathematics, Guangdong University of Technology, Guangzhou City, P. R. China ]
Jiadi Deng [ Department of Computer Science and Technology, Tsinghua University, Beijing City, P. R. China ]
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.7 No.6