Ep. 895: Algorithms, Negotiation and Persuasion with Michael Covel on Trend Following Radio
Michael Covel's Trend Following
00:00
The Importance of Refuse Minimization
There is explicitly a class of algorithms that are called regret minimization algorithms. In the multi-armed bandit problem, you can formalize the notion of regret. For example, how does your regret grow over time as a function of following best possible strategy? As it turns out, following the optimal algorithms in this problem, your regret will grow specifically will grow logarithmically.
Play episode from 26:17
Transcript
