In the talk we will look at the classical prophet inequality and its closely related secretary problem. These problems deal with sequential decision-making under uncertainty, such as selecting the best item from a sequence or maximizing revenue in posted price mechanisms. I will present recent advancements, including the order selection prophet inequality, IID prophet inequality, and results on achieving logarithmic regret in the multi-secretary problem.