Frequency capping in online advertising
From MaRDI portal
Publication:490332
DOI10.1007/S10951-014-0367-ZzbMATH Open1305.90242OpenAlexW2041830930MaRDI QIDQ490332FDOQ490332
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
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
- 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 (2)
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)
