mlsanityData to 7 Oct 2026

Real-time Bidding for Online Advertising: Measurement and Analysis

arXiv 1306.6542 ↗First posted 27 Jun 2013cs.GT cs.CE cs.IRcited by 32

Not on the map. Why?

Abstract (arXiv)

The real-time bidding (RTB), aka programmatic buying, has recently become the fastest growing area in online advertising. Instead of bulking buying and inventory-centric buying, RTB mimics stock exchanges and utilises computer algorithms to automatically buy and sell ads in real-time; It uses per impression context and targets the ads to specific people based on data about them, and hence dramatically increases the effectiveness of display advertising. In this paper, we provide an empirical analysis and measurement of a production ad exchange. Using the data sampled from both demand and supply side, we aim to provide first-hand insights into the emerging new impression selling infrastructure and its bidding behaviours, and help identifying research and design issues in such systems. From our study, we observed that periodic patterns occur in various statistics including impressions, clicks, bids, and conversion rates (both post-view and post-click), which suggest time-dependent models would be appropriate for capturing the repeated patterns in RTB. We also found that despite the claimed second price auction, the first price payment in fact is accounted for 55.4% of total cost due to the arrangement of the soft floor price. As such, we argue that the setting of soft floor price in the current RTB systems puts advertisers in a less favourable position. Furthermore, our analysis on the conversation rates shows that the current bidding strategy is far less optimal, indicating the significant needs for optimisation algorithms incorporating the facts such as the temporal behaviours, the frequency and recency of the ad displays, which have not been well considered in the past.

Key facts. Cited by 32 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Jun 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 7; 2023: 4; 2024: 5; 2025: 8; 2026: 6.

32 papers.

Sort:

By area:

  1. 2025CausalPFN: Amortized Causal Effect Estimation via In-Context Learningcited by 43
  2. 2025Generative Auto-Bidding with Value-Guided Explorationscited by 23
  3. 2025Agent Exchange: Shaping the Future of AI Agent Economicscited by 15
  4. 2022ROI-Constrained Bidding via Curriculum-Guided Bayesian Reinforcement Learningcited by 12
  5. 2022Challenges and approaches to privacy preserving post-click conversion predictioncited by 10
  6. 2023Dynamic fairness-aware recommendation through multi-agent social choicecited by 9
  7. 2023Offline Reinforcement Learning for Optimizing Production Bidding Policiescited by 8
  8. 2024Ads that Talk Back: Implications and Perceptions of Injecting Personalized Advertising into LLM Chatbotscited by 7
  9. 2021Online Advertising Revenue Forecasting: An Interpretable Deep Learning Approachcited by 5
  10. 2022Real-time Bidding Strategy in Display Advertising: An Empirical Analysiscited by 4
  11. 2021Arbitrary Distribution Modeling with Censorship in Real-Time Bidding Advertisingcited by 3
  12. 2024MEBS: Multi-task End-to-end Bid Shading for Multi-slot Display Advertisingcited by 3
20 more
  1. 2024Auto-bidding in real-time auctions via Oracle Imitation Learning (OIL)cited by 3
  2. 2022A Real-World Implementation of Unbiased Lift-based Bidding Systemcited by 2
  3. 2022Impression Allocation and Policy Search in Display Advertisingcited by 2
  4. 2023Interpretable Deep Learning for Forecasting Online Advertising Costs: Insights from the Competitive Bidding Landscapecited by 2
  5. 2025BAT: Benchmark for Auto-bidding Taskcited by 2
  6. 2025Expert-Guided Diffusion Planner for Auto-Biddingcited by 2
  7. 2022Adaptive Risk-Aware Bidding with Budget Constraint in Display Advertisingcited by 1
  8. 2025Advertising in AI systems: Society must be vigilantcited by 1
  9. 2026Generative AI Advertising as a Problem of Trustworthy Commercial Interventioncited by 1
  10. 2026Error-Aware Reverse Auction Mechanism for Large Language Model Routingcited by 1
  11. 2022A Unified Framework for Campaign Performance Forecasting in Online Display Advertisingcited by 0
  12. 2023Exploring Social Choice Mechanisms for Recommendation Fairness in SCRUFcited by 0
  13. 2024Class-aware and Augmentation-free Contrastive Learning from Label Proportioncited by 0
  14. 2024Hierarchical Multi-agent Meta-Reinforcement Learning for Cross-channel Biddingcited by 0
  15. 2025HALO: Hindsight-Augmented Learning for Online Auto-Biddingcited by 0
  16. 2025KP-Agent: Keyword Pruning in Sponsored Search Advertising via LLM-Powered Contextual Banditscited by 0
  17. 2026Generative Auto-Bidding with Unified Modeling and Explorationcited by 0
  18. 2026Constrained Auto-Bidding via Generative Response Modelingcited by 0
  19. 2026HMAF: A Hierarchical Multi-Slot GD-RTB Allocation Frameworkcited by 0
  20. 2026DRIVE: Distributional and Retrieval-Augmented Bidding with Value Evaluationcited by 0