When to stop being greedy and just park | Optimal stopping and dynamic programming
I see an open spot! Should I park or should I try to save a couple seconds of walking time by finding a closer spot? I feel like a lot of people have gone through this conundrum at some point in their lives (perhaps frequently). I talk about how we can find optimal decisions for this problem using a technique called dynamic programming. This problem is in an area called optimal stopping. If you want to learn more about the problem, check out chapter 2 of this online book on optimal stopping: https://www.math.ucla.edu/~tom/Stoppi... Timestamps: 0:00: Introduction to Problem 4:21: Problem Solution

▶︎
M-augmenting Paths to Maximum Matching: Demystifying Bipartite Graph Optimization

▶︎
Algorithms to Live By (Brian Christian at Designers + Geeks)

▶︎
How to Optimally Pack a Container | 2D Knapsack

▶︎
What in the world is a linear program?

▶︎
Machine Learning for Optimal Stopping Problems

▶︎
How to Find the Best Apartment with Optimal Stopping Theory || The Secretary Problem Explained

▶︎
The Hungarian Algorithm: How Uber, Tinder, and Tesla Solve the "Assignment Problem

▶︎
Mathematical Way to Choose a Toilet - Numberphile

▶︎
How do we OPTIMALLY assign drivers to riders? (Hungarian Algorithm) | Bipartite Matchings

▶︎
How To Think SO CLEARLY People Assume You're A Genius

▶︎
Mastering Dynamic Programming - How to solve any interview problem

▶︎
Instrumental Worship Guitar : Best Worship Song | Peaceful, Relaxing Instrumental Hymns on Guitar

▶︎
Gradients, Hessians, and All Those Derivative Tests

▶︎
Complete Dynamic Programming Practice - Noob to Expert | Topic Stream 1

▶︎
Counter-Intuitive Probability Puzzle: Random Walkers Meeting On A Grid

▶︎
How To Catch A Cheater With Math

▶︎
How To Make The Right Life Decisions Using Maths | The Optimal Stopping Problem

▶︎
The "Just One More" Paradox

▶︎
S3:E10 Secretary problem

▶︎
