Online Stochastic Packing Applied to Display Ad Allocation

DOI10.1007/978-3-642-15775-2_16zbMath1287.68186OpenAlexW1659045240MaRDI QIDQ3586461

Nitish Korula, Jon Feldman, Monika R. Henzinger, Clifford Stein, Vahab S. Mirrokni

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15775-2_16

Mathematics Subject Classification ID

Stochastic programming (90C15) Discrete location and assignment (90B80) Marketing, advertising (90B60) Online algorithms; streaming algorithms (68W27)

Related Items (32)

Strategyproof mechanisms for competitive influence in networks ⋮ Approximation algorithms for stochastic combinatorial optimization problems ⋮ Fully Dynamic Matching in Bipartite Graphs ⋮ Online Appointment Scheduling in the Random Order Model ⋮ A dynamic learning algorithm for online matching problems with concave returns ⋮ Primal Beats Dual on Online Packing LPs in the Random-Order Model ⋮ Online scheduling problems with flexible release dates: applications to infrastructure restoration ⋮ A stochastic algorithm for online bipartite resource allocation problems ⋮ Multiplicative Pacing Equilibria in Auction Markets ⋮ A Dynamic Near-Optimal Algorithm for Online Linear Programming ⋮ Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order ⋮ Bicriteria Online Matching: Maximizing Weight and Cardinality ⋮ Online allocation and display ads optimization with surplus supply ⋮ Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising ⋮ Approximations to Stochastic Dynamic Programs via Information Relaxation Duality ⋮ Bandits with Global Convex Constraints and Objective ⋮ An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals ⋮ Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios ⋮ Improved Online Algorithms for Knapsack and GAP in the Random Order Model ⋮ On variants of the matroid secretary problem ⋮ Unnamed Item ⋮ Improved online algorithms for Knapsack and GAP in the random order model ⋮ Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts ⋮ Iterative computation of security strategies of matrix games with growing action set ⋮ Online k-max Search Algorithms with Applications to the Secretary Problem ⋮ How the Experts Algorithm Can Help Solve LPs Online ⋮ Tractable Equilibria in Sponsored Search with Endogenous Budgets ⋮ Online Submodular Maximization Problem with Vector Packing Constraint. ⋮ Budget-Management Strategies in Repeated Auctions ⋮ Unnamed Item ⋮ Online generalized assignment problem with historical information ⋮ Fair Resource Allocation in a Volatile Marketplace

This page was built for publication: Online Stochastic Packing Applied to Display Ad Allocation