atlas

Research map / Bandits and online learning / Online convex optimization and games

Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising

AAAI 2017 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 11 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the flow-based delivery policy instead of Random, HWM, Probability-Greedy, or Degree-GreedyGuaranteed advertising delivery · Random demand-supply graphs; average degrees 5, 10, 15, 20, and 25competitive ratio: about 0.015 for Random-Normalization and 0.035 for Gauss-Perturbation at average degree 5, compared with Degree-GreedyHelped
Increase average user-type degreeThe studied delivery policies · Random demand-supply graphscompetitive ratioHelped
Increase the number of exposures per ad campaignThe studied delivery policies · Random-Normalization and Gauss-Perturbation; average degrees 5 and 10competitive ratioNo clear effect
Use an estimated user-type distribution with bounded relative errorFlow-based delivery policy · CMPUT with distribution error bounded by δexpected user traffic consumption: (1+O(n^{-ε/2}))(1+δ)/(1-δ)Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy