Ad network optimization: Evaluating linear relaxations

Flávio Sales Truzzi, Valdinei Freire Da Silva, Anna Helena Reali Costa, Fabio Gagliardi Cozman

Research output: Contribution to conferenceConference Paper

1 Scopus citations

Abstract

This paper presents a theoretical and empirical analysis of linear programming relaxations to ad network optimization. The underlying problem is to select a sequence of ads to send to websites, while an optimal policy can be produced using a Markov Decision Process, in practice one must resort to relaxations to bypass the curse of dimensionality. We focus on a state-of-art relaxation scheme based on linear programming. We build a Markov Decision Process that captures the worst-case behavior of such a linear programming relaxation, and derive theoretical guarantees concerning linear relaxations. We then report on extensive empirical evaluation of linear relaxations, our results suggest that for large problems (similar to ones found in practice), the loss of performance introduced by linear relaxations is rather small. © 2013 IEEE.
Original languageAmerican English
Pages219-224
Number of pages6
DOIs
StatePublished - 1 Jan 2013
Externally publishedYes
EventProceedings - 2013 Brazilian Conference on Intelligent Systems, BRACIS 2013 -
Duration: 1 Jan 2013 → …

Conference

ConferenceProceedings - 2013 Brazilian Conference on Intelligent Systems, BRACIS 2013
Period1/01/13 → …

Fingerprint

Dive into the research topics of 'Ad network optimization: Evaluating linear relaxations'. Together they form a unique fingerprint.

Cite this