arXiv:2412.06167v2 Announce Type: replace
Abstract: In digital advertising, demand-side platforms (DSPs) allow advertisers to create multiple ad creatives from a single photo for real-time bidding. W...
By Ruizhi Wang, Yu Rong, Kai Liu, Bingjie Li, Qingpeng Cai, Fei Pan, Peng Jiang
arXiv:2604. 05845v2 Announce Type: replace-cross Abstract: Auto-bidding services optimize real-time bidding strategies for advertisers under key performance indicator (KPI) constraints such as target return on investment and budget.
By Linghui Meng, Chun Gan, Shengsheng Niu, Chengcheng Zhang, Chenchen Li, Chuan Yang, Yi Mao, Xin Zhu, Jie He, Zhangang Lin, Ching Law
arXiv:2607. 27265v1 Announce Type: new Abstract: Real-time bidding is central to computational advertising, comprising three elements: Supply Side Platform (SSP) selling ad impressions, Demand Side Platform (DSP) bidding for advertisers, and Ad Exchange conducting auctions between them.
By Shengtian Yang, Yewen Li, Peng Jiang, Zhiyi Lyu, Bo An, Peng Jiang, Qingpeng Cai, Lei Feng
arXiv:2510. 15238v2 Announce Type: replace-cross Abstract: Optimizing a single advertising campaign across heterogeneous channels is a central challenge in industrial autobidding.
By Qi Li, Wendong Huang, Qichen Ye, Wutong Xu, Cheems Wang, Wei Yuan, Miao Xu, Zhiyu Mou, Guan Wang, Rongquan Bai, Chuan Yu, Jian Xu
arXiv:2608. 03705v1 Announce Type: new Abstract: 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.
By Jonaid Shianifar, Blaz Mramor, Fangda Zou, Matthieu C. Martin, Xingsheng Guo, Zhihua Zhu, Rong Zhou, Bichen Shi
arXiv:2608. 00123v1 Announce Type: cross Abstract: LLM-native advertising embeds sponsored content directly into model-generated responses, shifting the unit of sale from a fixed slot to a moment within an evolving conversation.
By Yan Fang, Jialin Chen, Chun Gan, Hang Yu, Mingjun Nie, Yeyu Zhang, Fengxiang He, Ching Law
arXiv:2607. 14418v1 Announce Type: new Abstract: Ad-load design is a central supply-side decision in sponsored search: more sponsored slots can raise revenue, but may crowd out organic results and degrade user outcomes.
By Mohammad Rashid, Hema Yoganarasimhan
The paper extends the Expected Cost-per-Mille (eCPM) framework to handle auction and hybrid "Auction with Buy It Now" (ABIN) listings by deriving a marginal eCPM (meCPM) that captures the incremental value of showing an additional impression for items whose prices evolve dynamically. This unified ranking objective allows fixed-price, auction, and ABIN listings to be compared and ranked together. A production implementation was tested via online A/B experiments on a large e-commerce platform, yielding positive revenue gains and statistically significant improvements in user metrics, leading to deployment in production.
By Greg Kocher, Sanjana Arun
UniPolicy is a unified objective‑specific policy framework for search advertising that jointly optimizes relevance, click propensity, and commercial value. It uses objective‑aware prefix tokens, sparse MoE‑LoRA routing, and residual FFNs to decouple parameters within a shared backbone, and constructs pairwise preferences from multi‑stage behavioral feedback to strengthen clicked candidates. In large‑scale offline tests and a 7‑day online A/B test, UniPolicy improves CTR by 0.71%, RPS by 1.58%, and advertising revenue by 1.32% while keeping serving latency stable.
By Kun Yao, Yuhang Zhou, Yichi Zhang, Zeliang Tong, Shengri Xue, Haitao Wang, Siyu Lu, Qianlong Xie, Xingxing Wang
The paper introduces the Latent Advertiser Mixture Auction (LAMA), a token‑level advertising framework that integrates advertiser influence directly into the text generation process. Advertisers provide local continuation values that shape next‑token policies, and the platform decodes these through a latent mixture while updating an allocation posterior. LAMA is shown to satisfy Markov DSIC and IR, achieve near‑optimal KL‑regularized welfare, and, in proof‑of‑concept experiments on commercial‑search queries, improve platform welfare and revenue without compromising user‑facing response quality.
By Hanbing Liu, Bowei Zhang, Changyuan Yu, Yinyu Ye, Qi Qi
The paper proposes an inference auction for large language model (LLM) APIs, enabling users to bid for faster service when compute demand exceeds capacity. The auction allocates priority efficiently without increasing latency, and includes fast algorithms for truthful bidding and an autobidding agent that adjusts bids within a user’s budget to maximize utility. Experiments show the auction improves system welfare while preserving the cache utilization and latency benefits of the SGLang inference framework.
By Keegan Harris, Siddharth Prasad, Asher Trockman, Nika Haghtalab, Michael I. Jordan
arXiv:2609.08211v1 Announce Type: new
Abstract: Real-world Multi-Objective Reinforcement Learning (MORL) often suffers from sparse rewards, reward conflicts, and late-stage reward tug-of-war, causing...
By Shanwen Mao, Hao Zhang, Guangtao nie, Zhiheng Li, Huimu Wang, Sulong Xu, Gu Simiu