Title: Theory / Unimportant / CS / Algo / to live by

Page: https://en.wikipedia.org/wiki/Optimal_stopping
Name: Discrete optimal stopping
Returns: Some integer \(i\) so that the reward is as high as possible
Input: A sequence of random variables \((X_i)_i\) with known joint distribution
A sequence of reward function \((y_i:\prod_{j=1}^iX_i\to \mathbb R)\)

Page: https://en.wikipedia.org/wiki/Secretary_problem
Name: Secretary problem
Returns: Some integer \(i\) so that after having seen \(i\) secretaries, we believe the current one is as good as possible
Input: \(n\) an integer
\((\{S_1,\dots,S_n\},<)\) a totally ordered set of secretaries, with the order unknown until both secretaries are met