Prisoner's Dilemma Competition won by ECS team
A solution which allows computer agents to collude, rather than compete with each other, has won this yearâs recreation of Axelrodâs classic Iterated Prisonerâs Dilemma competition. The winning solution was devised by a team from the University of Southamptonâs School of Electronics and Computer Science (ECS) which met the competitionâs 20th anniversary challenge to resolve the original dilemma in a noisy environment where moves could be misinterpreted. Professor Nick Jennings, a member of the ECS winning team said: âWe developed ways of looking at the Prisonerâs Dilemma in a more realistic environment and devised a way for agents to recognise and collude with one another despite the noise. Our solution beats the standard tit-for-tat strategy.â The Iterated Prisonerâs Dilemma has been of interest to the world of computer science since the publication of Robert Axelrodâs seminal book in the 1980s. It presents a simple game between two prisoners, in which their combined choices to co-operate or defect, determines whether they are imprisoned or walk free. Both players make a choice and then their decisions are revealed and both receive scores. Up to this year, the most common strategy applied to the dilemma was tit-for-tat which consistently outperformed every strategy entered in the original competition. It starts out by co-operating, and then punishes any strategy that defects by defecting on the next move. The solution devised by ECS uses coding theory to enable agents to recognise one another and to transmit messages reliably over noisy communication channels. No outside communication is allowed so the agents have to recognise one another by playing a specific sequence of moves at the start of each game. Dr Alex Rogers, another ECS team member said: âA key question in future computing systems is how the different agents within the system should interact and co-operate. Working on simple models such as the Prisonerâs Dilemma gives a fundamental understanding of how to tackle these problems.â?