All courses

Advanced · module A4

Probabilistic Reasoning, Decisions and Game Theory

By the end: Build and query probabilistic models, track hidden states over time, and analyse decisions and strategic interactions

Covers
Reasoning and deciding under uncertainty, over time and among many agents
Contents
4 chapters, 12 topics
Time
About 3 hours
Level
Advanced
Your progress
0 / 12

This module builds on Problem Solving and Reasoning: Classical AI, Advanced Mathematics for AI. We suggest looking at it first, but the choice is yours.

Chapter 1 Probabilistic Models

  1. 1.1

    Bayesian Networks

    Graphs of conditional dependence and conditional probability tables

    Code: build and query a network

    P(x₁…xₙ) = Π P(xᵢ|parents(xᵢ))

    15 minBeing written
  2. 1.2

    Exact and Approximate Inference

    Variable elimination, sampling and Gibbs sampling

    Code: compare exact and sampled answers

    15 minBeing written
  3. 1.3

    Causal Models

    Interventions, confounders and the do-operator

    Code: a confounded example

    P(Y|do(X))

    12 minBeing written

Chapter 2 Reasoning Over Time

  1. 2.1

    Markov Chains

    States, transition matrices and stationary distributions

    Code: weather simulation

    10 minBeing written
  2. 2.2

    Hidden Markov Models

    Forward-backward and Viterbi algorithms

    Code: part-of-speech tagging

    15 minBeing written
  3. 2.3

    Kalman and Particle Filters

    Tracking a moving object from noisy sensors

    Code: track a moving point

    x̂ = x̂⁻ + K(z − Hx̂⁻)

    15 minBeing written

Chapter 3 Decisions

  1. 3.1

    Utility Theory and Decision Networks

    Expected utility, risk and the value of information

    Code: an expected-utility decision

    EU(a) = Σ P(s|a) U(s)

    12 minBeing written
  2. 3.2

    Sequential Decisions and POMDPs

    Planning with uncertain outcomes and hidden states

    Reading and demo

    12 minBeing written

Chapter 4 Many Agents

  1. 4.1

    Game Theory

    Normal-form games, dominant strategies and Nash equilibrium

    Interactive: the prisoner's dilemma

    12 minBeing written
  2. 4.2

    Cooperative Games and the Shapley Value

    Fair division of value, and its use in explaining models

    Code: compute Shapley values

    12 minBeing written
  3. 4.3

    Mechanism Design and Auctions

    Designing rules so agents behave well

    Case study: ad auctions

    10 minBeing written
  4. 4.4

    Module Review and Assessment

    Derivations and a scored quiz

    Graded problem set

    20 minBeing written