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 …

Matching, capturing allocation of items to unit-demand buyers, or tasks to workers, or pairs of
collaborators, is a central problem in economics. Indeed, the growing prevalence of …

We consider online allocation problems with concave revenue functions and resource
constraints, which are central problems in revenue management and online advertising. In …

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 …

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 …

We introduce the online stochastic Convex Programming (CP) problem, a very general
version of stochastic online problems which allows arbitrary concave objectives and convex …

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 …

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 …

We introduce the abstract problem of rounding an unknown fractional bipartite b-matching x
revealed online (eg, output by an online fractional algorithm), exposed node-by-node on …

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 …