mlsanityData to 7 Oct 2026

Real-Time Bidding Benchmarking with iPinYou Dataset

arXiv 1407.7073 ↗First posted 25 Jul 2014cs.GT cs.CYcited by 19

Not on the map. Why?

Abstract (arXiv)

Being an emerging paradigm for display advertising, Real-Time Bidding (RTB) drives the focus of the bidding strategy from context to users' interest by computing a bid for each impression in real time. The data mining work and particularly the bidding strategy development becomes crucial in this performance-driven business. However, researchers in computational advertising area have been suffering from lack of publicly available benchmark datasets, which are essential to compare different algorithms and systems. Fortunately, a leading Chinese advertising technology company iPinYou decided to release the dataset used in its global RTB algorithm competition in 2013. The dataset includes logs of ad auctions, bids, impressions, clicks, and final conversions. These logs reflect the market environment as well as form a complete path of users' responses from advertisers' perspective. This dataset directly supports the experiments of some important research problems such as bid optimisation and CTR estimation. To the best of our knowledge, this is the first publicly available dataset on RTB display advertising. Thus, they are valuable for reproducible research and understanding the whole RTB ecosystem. In this paper, we first provide the detailed statistical analysis of this dataset. Then we introduce the research problem of bid optimisation in RTB and the simple yet comprehensive evaluation protocol. Besides, a series of benchmark experiments are also conducted, including both click-through rate (CTR) estimation and bid optimisation.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Jul 2014.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 7; 2024: 0; 2025: 2; 2026: 7.

19 papers.

Sort:

By area:

  1. 2023Online Ad Allocation with Predictionscited by 7
  2. 2022Real-time Bidding Strategy in Display Advertising: An Empirical Analysiscited by 4
  3. 2023Coordinated Dynamic Bidding in Repeated Second-Price Auctions with Budgetscited by 4
  4. 2021Arbitrary Distribution Modeling with Censorship in Real-Time Bidding Advertisingcited by 3
  5. 2023xDeepInt: a hybrid architecture for modeling the vector-wise and bit-wise feature interactionscited by 2
  6. 2026Decision Support for Marketplace Policies under Incomplete Evidence: From Replay to Launch Readinesscited by 2
  7. 2023AdaEnsemble: Learning Adaptively Sparse Structured Ensemble Network for Click-Through Rate Predictioncited by 1
  8. 2026Learning to Bid with Unknown Private Values in Budget-Constrained First-Price Auctionscited by 1
  9. 2026PlatformBid: An Auto-Bidding Benchmark from a Unified Advertising Platform's Perspectivecited by 1
  10. 2022Risk-Aware Bid Optimization for Online Display Advertisementcited by 0
  11. 2023DynInt: Dynamic Interaction Modeling for Large-scale Click-Through Rate Predictioncited by 0
  12. 2023Improving Real-Time Bidding in Online Advertising Using Markov Decision Processes and Machine Learning Techniquescited by 0
7 more
  1. 2023Online and Streaming Algorithms for Constrained k-Submodular Maximizationcited by 0
  2. 2025Feature Staleness Aware Incremental Learning for CTR Predictioncited by 0
  3. 2025DCN^2: Interplay of Implicit Collision Weights and Explicit Cross Layers for Large-Scale Recommendationcited by 0
  4. 2026Guiding the Recommender: Information-Aware Auto-Bidding for Content Promotioncited by 0
  5. 2026Knowledge-informed Bidding with Dual-process Control for Online Advertisingcited by 0
  6. 2026Fixed-Confidence Best-Arm Identification for Causal Mediation Analysiscited by 0
  7. 2026When Privacy Moves ML-Mediated Decisions On Device: Information and Incentive Misalignment in Auctionscited by 0