Lectures related to Dynamic Programming: Optimal Decision Making

Explores the coin change problem, comparing greedy and dynamic programming algorithms for optimal solutions.

Explores dynamic programming in finance, emphasizing optimal prediction strategies in market scenarios.

Covers the Simplex algorithm for function minimization with linear constraints.

Explores risk, uncertainty, subjective probabilities, and decision-making under different scenarios.

Delves into decision-making under risk, bounded rationality, prospect theory, and framing, with insights from behavioral economics.

Explores dynamic programming through rod cutting and change making optimization problems.

Introduces differential forms on manifolds, covering tangent bundles and intersection pairings.