Online Matching in Evolving Environments

Related lectures (28)

Page 2 of 3

Explores optimal stopping, explore/exploit, Bayes' Rule, and logarithmic regret in bandit solutions.

Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.

Covers the fundamentals of Design of Experiments (DOE) and experimental strategies.

Explores paired tests using a shoe sole experiment, showing significant differences between materials A and B.

Covers the application of Markov chains and algorithms for function optimization and graph colorings.

Explores the definition and origins of algorithms, including examples and types.

Covers the basics of information theory, entropy, and fixed points in graph colorings and the Ising model.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Covers the analysis of quick sort, including time complexity and randomization for finding the k-th smallest number.