Abstract
Capacity or budget planning is an important component of any online ad serving platform. This has given rise to a rich and exciting line of work in online algorithms, and one of the most successful marriages of theory and practice. The practical aspects have directly influenced the theory and the theory has had significant impact on the design of modern advertising systems. The talk will give an overview of this interaction and some recent results on a very general problem called the online convex programming problem.