Online display advertising markets: A literature review and future directions

H Choi, CF Mela, SR Balseiro… - Information Systems …, 2020 - pubsonline.informs.org
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 …

Optimizing display advertising markets: Challenges and directions

N Korula, V Mirrokni, H Nazerzadeh - IEEE Internet Computing, 2015 - ieeexplore.ieee.org
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 …

Online ad assignment with free disposal

J Feldman, N Korula, V Mirrokni… - … workshop on internet …, 2009 - Springer
We study an online weighted assignment problem with a set of fixed nodes corresponding to
advertisers and online arrival of nodes corresponding to ad impressions. Advertiser a has a …

Online submodular maximization with preemption

N Buchbinder, M Feldman, R Schwartz - ACM Transactions on …, 2019 - dl.acm.org
Submodular function maximization has been studied extensively in recent years under
various constraints and models. The problem plays a major role in various disciplines. We …

A dynamic pricing model for unifying programmatic guarantee and real-time bidding in display advertising

B Chen, S Yuan, J Wang - … of the Eighth International Workshop on Data …, 2014 - dl.acm.org
There are two major ways of selling impressions in display advertising. They are either sold
in spot through auction mechanisms or in advance via guaranteed contracts. The former has …

Whole-page optimization and submodular welfare maximization with online bidders

NR Devanur, Z Huang, N Korula, VS Mirrokni… - ACM Transactions on …, 2016 - dl.acm.org
In the context of online ad serving, display ads may appear on different types of web pages,
where each page includes several ad slots and therefore multiple ads can be shown on …

Randomized algorithms for online knapsack problems

X Han, Y Kawase, K Makino - Theoretical Computer Science, 2015 - Elsevier
In this paper, we study online knapsack problems. The input is a sequence of items e 1, e
2,…, en, each of which has a size and a value. Given the ith item ei, we either put ei into the …

Secretary problems: Laminar matroid and interval scheduling

S Im, Y Wang - Proceedings of the twenty-second annual ACM-SIAM …, 2011 - SIAM
The classical secretary problem studies the problem of hiring the best secretary from among
the secretaries who arrive in random order by making immediate and irrevocable decisions …

Improved online algorithms for knapsack and GAP in the random order model

S Albers, A Khan, L Ladewig - Algorithmica, 2021 - Springer
The knapsack problem is one of the classical problems in combinatorial optimization: Given
a set of items, each specified by its size and profit, the goal is to find a maximum profit …

An integrated effectiveness framework of mobile in-app advertising

VNX Truong, M Nkhoma… - Australasian Journal of …, 2019 - journal.acs.org.au
Advertising in mobile apps has recently become one of the most popular advertising
channels for businesses when its annual revenue has rapidly increased year over year. On …