Frequency capping in online advertising

DOI10.1007/S10951-014-0367-ZMaRDI QIDQ490332zbMATH OpenOpenAlexFDO

Authors 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

advertisingcompetitive analysisfrequency cappingonline allocation

Mathematics Subject Classification ID

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

Recommendations

• Frequency capping in online advertising (extended abstract)
• Online matching and ad allocation
• scientific article; zbMATH DE number 7042405
• The adwords problem with strict capacity constraints
• Brand and price advertising in online markets
• Fairness and efficiency in online advertising mechanisms
• Algorithmic Challenge in Online Advertising
• Online ad allocation in bounded-degree graphs

Cites work

• A general approach to online network optimization problems
• A primal-dual randomized algorithm for weighted paging
• AdWords and generalized online matching
• Adwords Auctions with Decreasing Valuation Bids
• An optimal deterministic algorithm for online \(b\)-matching
• Dynamic pricing for impatient bidders
• Near-optimal online auctions
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• Online Stochastic Matching: Beating 1-1/e
• Online learning in online auctions
• Online primal-dual algorithms for covering and packing
• Randomized competitive algorithms for generalized caching
• The online set cover problem

Cited in

(4)

• Frequency capping in online advertising (extended abstract)
• The adwords problem with strict capacity constraints
• New online algorithms for story scheduling in web advertising
• Optimal allocation for chunked-reward advertising

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490332)