Position Auctions in AI-Generated Content
Santiago R. Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng, Jieming Mao, Aranyak Mehta, Vahab Mirrokni, Renato Paes Leme, Di Wang, Song Zuo
Abstract
We consider an extension to the classic position auctions in which sponsored creatives can be added within AI generated content rather than shown in predefined slots. New challenges arise from the natural requirement that sponsored creatives should smoothly fit into the context. With the help of advanced LLM technologies, it becomes viable to accurately estimate the benefits of adding each individual sponsored creatives into each potential positions within the AI generated content by properly taking the context into account. Therefore, we assume one click-through rate estimation for each position-creative pair, rather than one uniform estimation for each sponsored creative across all positions in classic settings. As a result, the underlying optimization becomes a general matching problem, thus the substitution effects should be treated more carefully compared to standard position auction settings, where the slots are independent with each other. In this work, we formalize a concrete mathematical model of the extended position auction problem and study the welfare-maximization and revenue-maximization mechanism design problem. Formally, we consider two different user behavior models and solve the mechanism design problems therein respectively. For the Multinomial Logit (MNL) model, which is order-insensitive, we can efficiently implement the optimal mechanisms. For the cascade model, which is order-sensitive, we provide approximately optimal solutions.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 5e895cbc-aab6-4ef7-81b8-e0a58ae69bcbBuilds on7
- Can Large Language Models Serve as Rational Players in Game Theory? A Systematic AnalysisCaoyun Fan, Jindou Chen, Yaohui Jin, Hao HeAAAI 2024 · 123 citations
- Mechanism Design for Large Language ModelsPaul Dütting, Vahab Mirrokni, Renato Paes Leme, Haifeng Xu et al.WWW 2024 · 65 citations
- Truthful Aggregation of LLMs with an Application to Online AdvertisingErmis Soumalias, Michael Curry, Sven SeukenNeurIPS 2025 · 44 citations
- Ad Auctions for LLMs via Retrieval Augmented GenerationMohammadTaghi Hajiaghayi, Sébastien Lahaie, Keivan Rezaei, Suho ShinNeurIPS 2024 · 31 citations
- Mechanism Design for LLM Fine-tuning with Multiple Reward ModelsHaoran Sun, Yurong Chen, Siwei Wang, Chu Xu et al.NeurIPS 2025 · 26 citations
Related papers
- Auctions with LLM SummariesAvinava Dubey, Zhe Feng, Rahul Kidambi, Aranyak Mehta et al.KDD 2024 · 3 citations
- Autobidding Auctions with LLM-Powered CreativesBingzhe Wang, Bowei Zhang, Changyuan Yu, Qi QiICML 2026
- A Context-Aware Framework for Integrating Ad Auctions and RecommendationsYuchao Ma, Weian Li, Yuejia Dou, Zhiyuan Su et al.WWW 2025 · 3 citations
- Deep Automated Mechanism Design for Integrating Ad Auction and Allocation in FeedXuejian Li, Ze Wang, Bingqi Zhu, Fei He et al.SIGIR 2024 · 9 citations
- EPMD: A Framework for LLM-Enhanced Ad AuctionsBingzhe Wang, Bowei Zhang, Jiarui Gong, Changyuan Yu et al.KDD 2026
