Frequency capping in online advertising

DOI10.1007/s10951-014-0367-zzbMath1305.90242OpenAlexW2041830930MaRDI QIDQ490332

Yong-Cai Geng, Sumit K. Garg

Publication date: 22 January 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/201166/files/10951_2014_Article_367.pdf

zbMATH Keywords

competitive analysisadvertisingfrequency cappingonline allocation

Mathematics Subject Classification ID

Marketing, advertising (90B60) Internet topics (68M11)

Related Items (1)

New online algorithms for story scheduling in web advertising

Cites Work

• Unnamed Item
• An optimal deterministic algorithm for online \(b\)-matching
• Online learning in online auctions
• Randomized Competitive Algorithms for Generalized Caching
• Dynamic pricing for impatient bidders
• A general approach to online network optimization problems
• Online Primal-Dual Algorithms for Covering and Packing
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• AdWords and generalized online matching
• The Online Set Cover Problem
• Online Stochastic Matching: Beating 1-1/e
• A Primal-Dual Randomized Algorithm for Weighted Paging
• Adwords Auctions with Decreasing Valuation Bids

This page was built for publication: Frequency capping in online advertising