Citizen Lab’s investigation reveals that the Webloc platform harvests advertising IDs and real‑time bidding data from billions of mobile devices, enabling law‑enforcement agencies in the US, EU and elsewhere to track half a billion users worldwide, while most users remain unaware of the privacy risks.
This article presents the BiCB (Binary Constrained Bidding) algorithm, a lightweight auto‑bidding solution for live advertising that combines optimal bidding formulas derived from linear‑programming dual analysis with traffic‑prediction statistics to achieve near‑optimal performance under budget and CPC constraints.
This article explains how Apache Ignite's memory‑first architecture, distributed compute grid, and event‑driven streaming enable sub‑100 ms decision making, high throughput, and strong consistency for real‑time bidding platforms, with practical code examples, Spring Boot integration, monitoring tips, and security considerations.
The article explains the core challenges of real‑time bidding, reviews Kuaishou's evolution from PID to MPC to reinforcement learning, and introduces generative reinforcement‑learning methods (GAVE and CBD) that combine decision transformers or diffusion models with value‑guided exploration and score‑based RTG, achieving significant offline and online performance gains.
This article explains the core challenges of real‑time bidding, traces the evolution from PID to MPC to reinforcement learning, and details how generative reinforcement‑learning techniques such as GAVE and CBD combine diffusion models, value‑guided exploration, and score‑based return‑to‑go to dramatically improve ad‑bid efficiency and revenue.
This article explores advanced machine learning techniques for optimizing bid shading in real-time advertising auctions, introducing a mixed censorship multi-task learning framework and a cost-effective active learning strategy to accurately predict winning price distributions and overcome sample selection bias.
NetEase Cloud Music’s RTA advertising system delivers real‑time, personalized ads at massive scale by using isolated Nginx clusters, layered decoupling, asynchronous Netty/Redis processing, and optimized storage with hash‑based key compression and Protostuff serialization, while supporting automated audience selection and in‑app attribution to boost user acquisition.
This article explains Hulu/Disney’s programmatic advertising ecosystem, detailing the roles of ADN, ADX, SSP, DSP, and DMP, the real‑time bidding workflow, private marketplace order types, and the unified decision engine that balances direct and programmatic ads to maximize revenue.
Xiaohongshu’s commercial team modeled the real‑time bidding process for its “Fries” ad product, derived an optimal linear‑programming bid formula, and implemented a simple two‑parameter PID‑controlled scheme that meets client pacing, delivery guarantees, and platform profit goals while using practical heuristics.
The paper presents a Curriculum‑Guided Bayesian Reinforcement Learning (CBRL) framework that models ROI‑constrained real‑time bidding as a partially observable constrained MDP, using hard‑margin indicator rewards and a curriculum of relaxed proxy problems to achieve fast, constraint‑satisfying, Bayes‑optimal policies that outperform existing methods on large‑scale industrial data.
This article details Huya's comprehensive user growth framework, covering the full acquisition‑activation‑retention‑revenue funnel, advertising workflow, crowd targeting stages, uplift modeling, virtual callbacks, intelligent bidding, and engineering implementations such as material automation, low‑latency RTA filtering, and dynamic strategy operators.
The paper proposes an actor‑critic reinforcement‑learning model (ACRL) that leverages PPO and a deep structured semantic model to optimize real‑time bidding strategies for mobile game ads under CPM and budget constraints, addressing long user lifecycles and sparse conversion data while demonstrably improving ROI in both offline simulations and online A/B tests.
Tencent's IEG Growth Middle Platform team announced that two of its research papers—one presenting an actor‑critic reinforcement learning model for real‑time bidding in online display advertising and the other proposing an adversarial adaptation framework for cross‑domain recommendation—were accepted at the top‑tier CIKM conference, highlighting novel algorithms that achieve state‑of‑the‑art performance and have been deployed to serve billions of daily impressions.
The paper presents MACG, a multi‑agent cooperative bidding game that integrates a global objective with individual advertiser goals, derives optimal bidding formulas, employs a strategy network and evolutionary search to tune parameters, and demonstrates over‑5% metric gains and stable 15‑day performance in Taobao’s online advertising platform.
The paper proposes a unified solution for real‑time bidding in online display ads that formulates advertiser budget and KPI limits as a constrained linear program, derives a closed‑form optimal bidding function with m+1 parameters, and uses model‑free reinforcement learning to dynamically adjust those parameters, achieving superior traffic‑value capture in large‑scale deployment on Alibaba’s Taobao platform.
This article presents a comprehensive overview of the 58.com alliance advertising platform, detailing its business model, core modules such as SSP, direct‑investment, DSP and creative platforms, media integration flow, performance optimizations, GC tuning, indexing strategies, and future directions for programmatic creative generation.
This article explains how the classic PID feedback control algorithm can be adapted to regulate advertising bidding costs, describing its theory, component effects, practical implementation in a real‑time ad‑exchange, simulation experiments, and the resulting improvements in budget adherence and cost stability.
The article examines the high costs of user acquisition in the FinTech industry, explains real‑time bidding mechanics, and proposes layered bidding and federated learning‑based user‑value prediction as optimal strategies to balance ad spend, impressions, and conversion quality.
This article explains how Youku built and iterated its Demand‑Side Platform, covering business goals, system architecture, channel integration, bidding and frequency strategies, material selection, smooth budget delivery, retargeting, algorithmic recall, data monitoring, and conversion‑funnel optimization to drive user growth.
This article explains how real‑time bidding works in computational advertising, defines the budget‑constrained bidding problem, models it with reinforcement learning, and presents a deep‑network implementation together with visual analysis and key references.
Meituan’s demand‑side platform combines real‑time bidding with a two‑service architecture—RecServer for multi‑scenario ad recall and PredictorServer for CTR and conversion‑value prediction—leveraging behavior, location, collaborative‑filtering and matrix‑factorization features, logistic‑regression and GBDT models, and continuous A/B and metric monitoring to optimize ROI.
This article presents a comprehensive overview of DSP advertising system architecture, covering real‑time bidding infrastructure, audience targeting, data processing pipelines using Hadoop, Spark and Storm, click‑through‑rate prediction models, and anti‑fraud mechanisms, offering practical insights for engineers building high‑performance ad platforms.
