In this talk, I will present results from several papers on Adwords and Display Ads problems. I will introduce some of the concepts with a simple online secretary problem. This will be followed by the definitions of Adwords and Display Ads problems. I will then talk about a primal-dual approach to solving these problems. Finally, I will give an overview of a very interesting paper that addresses how to find optimal algorithms, and prove that they are optimal, in the general context of concave revenue functions.