arXiv:2608.03705cs.AIcs.LG2026-08中稿 · KDD

智能分流广告请求,降量提收,效果更稳。

Less Traffic, Better Outcomes: Competition-Aware Request Dispatch in Real-Time Ad Exchanges

  • 按竞标潜力预测,只发高价值请求给DSP
  • 减少34.2%请求量,净收入提升4.6%
  • 适合面临资源瓶颈的实时竞价平台

实时竞价广告交易平台通常将几乎所有请求转发给需求方平台(DSP),尽管仅有少数会收到出价。这种过度分发削弱了拍卖结果:受限于计算和预算,DSP会降低参与度,浪费有限的出价能力。本文提出一种竞争感知的请求分发框架,通过分布式出价预测与概率转发机制,决定是否将每个请求发送给各DSP。系统通过轻量级策略优化动态调整各DSP的阈值,以适应非平稳市场环境。我们在日均处理超200亿请求的生产平台进行了四轮连续线上实验。全量多DSP部署在政策生效后14天内,将DSP请求量降低34.2%,同时净收入提升4.6%(p<0.001)。进一步分析显示流量片段间存在显著异质性,聚合指标可能误导判断。分段与各DSP分析表明,该策略能揭示不同DSP的相对优势,在不增加总体请求数的前提下改善变现效果。

原文摘要 · Abstract (English)

Real-time bidding (RTB) ad exchanges typically forward nearly all incoming requests to demand-side platforms (DSPs), even though only a small fraction receive bids. This over-distribution weakens auction outcomes: DSPs throttle participation under compute and budget constraints, reducing the effective use of limited bidding capacity. We present a competition-aware request dispatch framework that uses distributional bid prediction and probabilistic forwarding to decide whether each request should be sent to each DSP. The system adapts per-DSP thresholds over time through lightweight policy optimization to track non-stationary market conditions. We evaluate the framework through four sequential online experiments on a production platform serving over 20 billion daily requests. A full multi-DSP deployment reduces DSP request volume under the policy by 34.2% while increasing net revenue by 4.6% (p<0.001) in a recent 14-day window after an initial DSP adaptation period. Further analysis highlights strong heterogeneity across traffic segments and reveals that aggregate metrics can be misleading. Segment-level and per-DSP analyses suggest that the policy surfaces comparative advantages among DSPs, improving monetized outcomes without increasing overall request volume.

实时竞价请求调度广告变现

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。