Mastère web intelligence

Games provide mathematical models for interaction. Numerous tasks in computer science can be formulated in game-theoretic terms. This fresh and intuitive way of thinking about complex issues reveals underlying algorithmic questions and clarifies the relationships between different domains.

By the end of the course, students will be able to:

1. Model strategic interaction using normal-form, extensive-form, and stochastic games.

2. Compute and reason about equilibria (Nash, correlated, subgame-perfect), including algorithmic/complexity aspects.

3. Analyze efficiency of equilibria (price of anarchy/stability; smoothness framework).

4. Use game models in CS domains: networks, security, verification/synthesis, and market/matching platforms.