@conference {15258,
	title = {Online allocation of display advertisements subject to advanced sales contracts},
	booktitle = {Proceedings of the Third International Workshop on Data Mining and Audience Intelligence for Advertising},
	series = {ADKDD {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {69 - 77},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to both online and offline allocation of display advertisements. Next, we focus on a particular instance of the online allocation problem, and design a simple online algorithm with provable approximation guarantees. Our algorithm is near optimal as is shown by a matching lower bound. Finally, we report on experiments to establish actual case behavior on some real datasets, with encouraging results.},
	keywords = {display advertising, modeling, online algorithms, OPTIMIZATION, simulation},
	isbn = {978-1-60558-671-7},
	doi = {10.1145/1592748.1592758},
	url = {http://doi.acm.org/10.1145/1592748.1592758},
	author = {Alaei,Saeed and Arcaute,Esteban and Khuller, Samir and Ma,Wenjing and Malekian,Azarakhsh and Tomlin,John}
}
