Notes on Mirrokni and Mehta, Algorithmic Theory and Practice in Online Ad Serving

As with all my handwritten notes, this has the usual disclaimer: these posts are just so I can use nice indexed search to find my notes, which are sufficient for me to recall talks and papers but probably not much use to anyone else. Slides here.

As an important part of any ad system, online ad serving is a rich source of challenging algorithmic, learning, and economic problems. In this tutorial, we survey recent algorithmic results known in the
context of online ad serving in various ad systems, including sponsored search and contextual ads, graphical (or display) ads, and other hybrid and multi-layer markets. In addition, we will discuss further theoretical as well as practical problems which come up in this area.

Advertisements
Notes on Mirrokni and Mehta, Algorithmic Theory and Practice in Online Ad Serving

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s