  The Adwords problem has always been an interesting internet advertising
problem. There are many ways to solve the Adwords problem with the adversarial
order model, including the Greedy Algorithm, the Balance Algorithm, and the
Scale-bid Algorithm, which is also known as MSVV. In this survey, I will review
the Adwords problem with different input models under a primal-dual setting,
and with the small-bid assumption. In the first section, I will focus on
Adwords with adversarial order model, and use duality to prove the efficiency
of the Greedy Algorithm and the MSVV algorithm. Next, I will look at a
primal-dual training-based algorithm for the Adwords problem with the IID
model.
