• Corpus ID: 44892814

Fast Demand Learning for Display Advertising Revenue Management

  title={Fast Demand Learning for Display Advertising Revenue Management},
  author={Dragos Florin Ciocan and Vivek F. Farias},
The present paper is motivated by the network revenue management problems that occur in online display advertising. In this setting, each impression (demand) type corresponds to a vector of d user features; consequently, the overall number of demand types that need to be forecast is exponential in d. Our main contribution is to show that such high dimensional demand spaces can still be estimated efficiently. In particular, using a number of demand samples that scales linearly in d and… 

A Dynamic Clustering Approach to Data-Driven Assortment Personalization

We consider an online retailer facing heterogeneous customers with initially unknown product preferences. Customers are characterized by a diverse set of demographic and transactional attributes. T...

Data-Driven Learning Models with Applications to Retail Operations

Data-Driven Learning Models with Applications to Retail Operations is presented, which presents a novel and scalable approach to data-driven learning that can be applied to solve the challenge of omni-channel shopping.



An Analysis of Bid-Price Controls for Network Revenue Management

Bid-prices are becoming an increasingly popular method for controlling the sale of inventoryin revenue management applications. In this form of control, threshold-or "bid"-prices are set for the

A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management

The solution to the deterministic problem suggests two heuristics for the stochastic problem that are shown to be asymptotically optimal as the expected sales volume tends to infinity.

Model Predictive Control for Dynamic Resource Allocation

A simple, easy to interpret algorithm for a large class of dynamic allocation problems with unknown, volatile demand and a new device---a balancing property---that allows to understand the impact of changing bases in the scheme.

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 contract for n(a)

The adwords problem: online keyword matching with budgeted bidders under random permutations

The problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit, is considered, and the current literature on this problem is extended by considering the setting where the keywords arrive in a random order.

Online Stochastic Packing Applied to Display Ad Allocation

It is proved that a simple dual training-based algorithm achieves a (1-o(1)- approximation guarantee in the random order stochastic model, which is a significant improvement over logarithmic or constant-factor approximations for the adversarial variants of the same problems.

Online Primal-Dual Algorithms for Covering and Packing

This work provides general deterministic primal-dual algorithms for online fractional covering and packing problems and also provides deterministic algorithms for several integral online covering andpacking problems.

AdWords and generalized on-line matching

The notion of a tradeoff revealing LP is introduced and used to derive two optimal algorithms achieving competitive ratios of 1-1/e for this problem of online bipartite matching.

Randomized Algorithms

This book introduces the basic concepts in the design and analysis of randomized algorithms and presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications.

Real Analysis and Probability

1. Foundations: set theory 2. General topology 3. Measures 4. Integration 5. Lp spaces: introduction to functional analysis 6. Convex sets and duality of normed spaces 7. Measure, topology, and