Online display advertising markets: A literature review and future directions
This paper summarizes the display advertising literature, organizing the content by the
agents in the display advertising ecosystem, and proposes new research directions. In doing …
agents in the display advertising ecosystem, and proposes new research directions. In doing …
Dual mirror descent for online allocation problems
S Balseiro, H Lu, V Mirrokni - International Conference on …, 2020 - proceedings.mlr.press
We consider online allocation problems with concave revenue functions and resource
constraints, which are central problems in revenue management and online advertising. In …
constraints, which are central problems in revenue management and online advertising. In …
Online matching and ad allocation
A Mehta - … and Trends® in Theoretical Computer Science, 2013 - nowpublishers.com
Matching is a classic problem with a rich history and a significant impact, both on the theory
of algorithms and in practice. Recently there has been a surge of interest in the online …
of algorithms and in practice. Recently there has been a surge of interest in the online …
A dynamic near-optimal algorithm for online linear programming
A natural optimization model that formulates many online resource allocation problems is
the online linear programming (LP) problem in which the constraint matrix is revealed …
the online linear programming (LP) problem in which the constraint matrix is revealed …
Optimizing display advertising markets: Challenges and directions
Display advertising is the major source of revenue for service and content providers on the
Internet. Here, the authors explain the prevalent mechanisms for selling display advertising …
Internet. Here, the authors explain the prevalent mechanisms for selling display advertising …
Fast algorithms for online stochastic convex programming
S Agrawal, NR Devanur - Proceedings of the twenty-sixth annual ACM-SIAM …, 2014 - SIAM
We introduce the online stochastic Convex Programming (CP) problem, a very general
version of stochastic online problems which allows arbitrary concave objectives and convex …
version of stochastic online problems which allows arbitrary concave objectives and convex …
Online stochastic packing applied to display ad allocation
Inspired by online ad allocation, we study online stochastic packing integer programs from
theoretical and practical standpoints. We first present a near-optimal online algorithm for a …
theoretical and practical standpoints. We first present a near-optimal online algorithm for a …
Autobidding with constraints
G Aggarwal, A Badanidiyuru, A Mehta - … , WINE 2019, New York, NY, USA …, 2019 - Springer
Autobidding is becoming increasingly important in the domain of online advertising, and has
become a critical tool used by many advertisers for optimizing their ad campaigns. We …
become a critical tool used by many advertisers for optimizing their ad campaigns. We …
Yield optimization of display advertising with ad exchange
S Balseiro, J Feldman, V Mirrokni… - Proceedings of the 12th …, 2011 - dl.acm.org
In light of the growing market of Ad Exchanges for the real-time sale of advertising slots,
publishers face new challenges in choosing between the allocation of contract-based …
publishers face new challenges in choosing between the allocation of contract-based …
Edge-weighted online bipartite matching
Online bipartite matching is one of the most fundamental problems in the online algorithms
literature. Karp, Vazirani, and Vazirani (STOC 1990) gave an elegant algorithm for …
literature. Karp, Vazirani, and Vazirani (STOC 1990) gave an elegant algorithm for …