Achieving cooperation with many prisoners in the NIPD
by J. Enrique Agudo; Colin Fyfe
International Journal of Computational Science and Engineering (IJCSE), Vol. 12, No. 1, 2016

Abstract: This paper discusses an empirical investigation into the N-person's iterated prisoners' dilemma (NIPD), a standard problem from game theory. We use both the cross entropy method and reinforcement learning and achieve cooperation with much greater sizes of population than we have previously been able to do with genetic algorithms and artificial immune systems. Our experimental results give some insight into the circumstances where cooperation might develop.

Online publication date: Sat, 06-Feb-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com