2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/130098We 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.Discrete MathematicsData Structures and AlgorithmsConstructing a maximum utility slate of on-line advertisementstext