Constructing a maximum utility slate of on-line advertisements

Simple item page
dc.creatorKeerthi, S. Sathiya
dc.creatorTomlin, John A.
dc.date2007-06-09
dc.date.accessioned2026-07-07T08:04:48Z
dc.date.available2026-07-07T08:04:48Z
dc.descriptionWe present an algorithm for constructing an optimal slate of sponsored search advertisements which respects the ordering that is the outcome of a generalized second price auction, but which must also accommodate complicating factors such as overall budget constraints. The algorithm is easily fast enough to use on the fly for typical problem sizes, or as a subroutine in an overall optimization.
dc.identifierhttps://arxiv.org/abs/0706.1318
dc.identifierhttp://arxiv.org/abs/0706.1318
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130098
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.titleConstructing a maximum utility slate of on-line advertisements
dc.typetext

Files

Collections

arXiv