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 …
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 …
Online ad assignment with free disposal
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 …
advertisers and online arrival of nodes corresponding to ad impressions. Advertiser a has a …
Online submodular maximization with preemption
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 …
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
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 …
in spot through auction mechanisms or in advance via guaranteed contracts. The former has …
Whole-page optimization and submodular welfare maximization with online bidders
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 …
where each page includes several ad slots and therefore multiple ads can be shown on …
Randomized algorithms for online knapsack problems
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 …
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
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 …
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
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 …
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 …
channels for businesses when its annual revenue has rapidly increased year over year. On …