COMP3160 : Artificial Intelligence - Efficacy of Evolutionary Algorithms - Computer Science Assignment Help

Assignment Task :

The goal of this assignment is to appreciate the efficacy of Evolutionary Algorithms, specif ically Genetic Algorithm (GA), in the context of game theory. In this assignment you will be using the DEAP package for Genetic Algorithm in order to evolve strategies for repeat edly playing 3-Person Prisoners Dilemma described below with a different storyline:1 

Task Specification 

Note: You are advised to go through the two supplied papers: 

i “Using GA to Develop Strategies for IPD,” by A Haider, and 

ii “An Experimental Study of N-Person IPD Games,” by X Yao and PJ. Darwen in the given order before proceeding with the assignment tasks. Give particular attention to Sections 4.1 and 2.1 of the respective works. 

1. BACKGROUND KNOWLEDGE ASSESSMENT 

(a) Analysing the Payoff matrix provided in Table 1, determine if a Nash Equilib rium exists for the game 3PD. If so, identify at least one of its Nash Equilibria, and explain why it is so. 

(b) Suppose we want to represent strategies for playing 3IPD of memory depth 2 in the context of GA. How many bits shall we need to represent the individuals, and why? Answer in no more than 50 words. 

(c) Consider a strategy (individual/chromosome) of memory-depth 2 for playing 3IPD. Explain how you would represent the memory bits and the default moves in this individual. 

2. IMPLEMENTATION IN PYTHON  

(a) Implement the function: 

payoff_to_ind1(individual1, individual2, individual3, game): returns payoff to individual1 

This Computer Science Assignment has been solved by our Computer Science Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.