Title: Learning game strategy design through iterated Prisoner's Dilemma

Authors: Raymond Chiong, Lubo Jankovic

Addresses: School of IT and Multimedia, Swinburne University of Technology (Sarawak Campus), Kompleks Negeri, Jalan Simpang Tiga, 93576 Kuching, Sarawak, Malaysia. ' InteSys Ltd, University of Birmingham Research Park, Vincent Drive, Birmingham B15 2SQ, UK

Abstract: The article investigates games strategies on the basis of experiments with iterated Prisoner|s Dilemma, a classical non-zero sum game. The objective is to determine which strategies have the best chance of winning. Although some strategies, like tit-for-tat, emerge as better than others in some cases, it appears that there is no overall winning strategy, but that success or failure of individual strategies depends upon the strategies adopted by a population of opponents. Therefore, the winning strategy will change dynamically, and will need to be determined while the game in progress. Based on the results of this work, a strategy engine for games development is proposed, and a future development of strategy middleware is discussed.

Keywords: cellular automata; game strategy design; iterated Prisoner|s Dilemma; IPD; games strategies; winning strategy; games development; strategy middleware.

DOI: 10.1504/IJCAT.2008.020957

International Journal of Computer Applications in Technology, 2008 Vol.32 No.3, pp.216 - 223

Published online: 26 Oct 2008 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article