Frequency capping in online advertising

DOI10.1007/S10951-014-0367-ZzbMATH Open1305.90242OpenAlexW2041830930MaRDI QIDQ490332FDOQ490332

Sumit K. Garg, Yong-Cai Geng

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)

Cites Work

• 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
• An optimal deterministic algorithm for online \(b\)-matching
• A general approach to online network optimization problems
• A Primal-Dual Randomized Algorithm for Weighted Paging
• Online learning in online auctions
• Randomized competitive algorithms for generalized caching
• Near-optimal online auctions
• Dynamic pricing for impatient bidders
• Adwords Auctions with Decreasing Valuation Bids

Cited In (1)

• New online algorithms for story scheduling in web advertising

   Recommendations

• Frequency capping in online advertising (extended abstract) 👍 👎
• Online matching and ad allocation 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)