Goals

In this course, we show how to model some complex problems encountered in various domains (biology, politics, economics, design, ... ) by dealing with non-standard optimization algorithms (heuristics, meta-heuristics) and game theory. On simple cases, we will illustrate these resolution processes.

Programme

Complexity / Heuristics / Simulated annealing / Genetic algorithms / Ant system / Particule swarm optimization Game Theory

Assessment method

Final mark = 50% Knowledge + 50% Know-how Knowledge = final exam Know-how = continuous assessment

Bibliography

  • J. Dréo, A. Pétrowski, P. Arry, E. Aillard, Métaheuristiques pour l'optimisation difficile., Eyrolles, 2003.0
  • Colin et Camerer., Behavioral Game Theory: Experiments in Strategic Interaction., The Roundtable Series in Behavioral Economics, 2003.0
Study
10h
 
Course
14h
 
TC
4h
 

Code

24_I_G_S09_MOS_02_1

Responsibles

  • Philippe MICHEL
  • Alexandre SAIDI
  • Joël PERRET LIAUDET

Language

French

Keywords

optimization algorithm, heuristics, game theory.