Truthful Aggregation of LLMs with an Application to Online Advertising
Ermis Soumalias, Michael Curry, Sven Seuken
Abstract
The next frontier of online advertising is revenue generation from LLM-generated content. We consider a setting where advertisers aim to influence the responses of an LLM to align with their interests, while platforms seek to maximize advertiser value and ensure user satisfaction. The challenge is that advertisers' preferences generally conflict with those of the user, and advertisers may misreport their preferences. To address this, we introduce MOSAIC, an auction mechanism that ensures that truthful reporting is a dominant strategy for advertisers and that aligns the utility of each advertiser with their contribution to social welfare. Importantly, the mechanism operates without LLM fine-tuning or access to model weights and provably converges to the output of the optimally fine-tuned LLM as computational resources increase. Additionally, it can incorporate contextual information about advertisers, which significantly improves social welfare. Through experiments with a publicly available LLM, we show that MOSAIC leads to high advertiser value and platform revenue with low computational overhead. While our motivating application is online advertising, our mechanism can be applied in any setting with monetary transfers, making it a general-purpose solution for truthfully aggregating the preferences of self-interested agents over LLM-generated replies.
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.
Cited by top-tier papers9
- Mechanism Design for Large Language ModelsPaul Dütting, Vahab Mirrokni, Renato Paes Leme, Haifeng Xu et al.WWW 2024 · 65 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
- Strategyproof Reinforcement Learning from Human FeedbackThomas Kleine Buening, Jiarui Gan, Debmalya Mandal, Marta KwiatkowskaNeurIPS 2025 · 10 citations
- Beyond RLHF and NLHF: Population-Proportional Alignment under an Axiomatic FrameworkKihyun Kim, Jiawei Zhang, Asuman Ozdaglar, Pablo A. ParriloICLR 2026 · 5 citations
Builds on6
- Direct Preference Optimization: Your Language Model is Secretly a Reward ModelRafael Rafailov, Archit Sharma, Eric Mitchell, Christopher D. Manning et al.NeurIPS 2023 · 10,924 citations
- Data Selection for Language Models via Importance ResamplingSang Michael Xie, Shibani Santurkar, Tengyu Ma, Percy LiangNeurIPS 2023 · 383 citations
- Mechanism Design for Large Language ModelsPaul Dütting, Vahab Mirrokni, Renato Paes Leme, Haifeng Xu et al.WWW 2024 · 65 citations
- Ad Auctions for LLMs via Retrieval Augmented GenerationMohammadTaghi Hajiaghayi, Sébastien Lahaie, Keivan Rezaei, Suho ShinNeurIPS 2024 · 31 citations
- Q-Probe: A Lightweight Approach to Reward Maximization for Language ModelsKenneth Li, Samy Jelassi, Hugh Zhang, Sham M. Kakade et al.ICML 2024 · 18 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
- Auctions between Regret-Minimizing AgentsYoav Kolumbus, Noam NisanWWW 2022 · 47 citations
- LBM: Hierarchical Large Auto-Bidding Model via Reasoning and ActingYewen Li, Zhiyi Lyu, Peng Jiang, Qingpeng Cai et al.WWW 2026
- Position Auctions in AI-Generated ContentSantiago R. Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng et al.WWW 2026 · 2 citations
