Back

Evolutionary Processes, Evolutionary Algorithms, Evolutionary Games

Credits: 3

Tags: Systems, Math, Probability

Class Overview

This course addresses a collection of topics relevant to the modeling, analysis, simulation, and optimization of large complex multi-agent systems. It also provides a standalone introduction to discrete-time Markov chains; covers the Metropolis algorithm and its generalizations; gives an introduction to the theory of genetic algorithms; and provides an introduction to evolutionary game theory, including the ESS concept, replicator dynamics, and dynamic probabilistic approaches.

Prerequisites: ECE 3100 or a strong familiarity with discrete probability.
Key Topics: Markov Chains, Genetic Algorithms, Evolutionary Game Theroy

Professor: Dr. David Delchamps

Semester(s): Spring

Difficulty: N/A

Rating: N/A

Assignments: Weekly problem sets.

Exams: One midterm and one final exam.

Pros

Cons

Tips for Success