Ad Auctions for LLMs via Retrieval Augmented Generation

• URL: http://arxiv.org/abs/2406.09459v1
• Date: Wed, 12 Jun 2024 22:05:51 GMT
• Title: Ad Auctions for LLMs via Retrieval Augmented Generation
• Authors: MohammadTaghi Hajiaghayi, Sébastien Lahaie, Keivan Rezaei, Suho Shin,
• Abstract summary: This paper introduces novel auction mechanisms for ad allocation and pricing within the textual outputs of large language models (LLMs) We propose a segment auction where an ad is probabilistically retrieved for each discourse segment according to its bid and relevance, following the RAG framework. We show that our auction maximizes logarithmic social welfare, a new notion of welfare that balances allocation efficiency and fairness, and we characterize the associated incentive-compatible pricing rule.
• Score: 12.9128551468564
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the field of computational advertising, the integration of ads into the outputs of large language models (LLMs) presents an opportunity to support these services without compromising content integrity. This paper introduces novel auction mechanisms for ad allocation and pricing within the textual outputs of LLMs, leveraging retrieval-augmented generation (RAG). We propose a segment auction where an ad is probabilistically retrieved for each discourse segment (paragraph, section, or entire output) according to its bid and relevance, following the RAG framework, and priced according to competing bids. We show that our auction maximizes logarithmic social welfare, a new notion of welfare that balances allocation efficiency and fairness, and we characterize the associated incentive-compatible pricing rule. These results are extended to multi-ad allocation per segment. An empirical evaluation validates the feasibility and effectiveness of our approach over several ad auction scenarios, and exhibits inherent tradeoffs in metrics as we allow the LLM more flexibility to allocate ads.

Related papers

• Fair Allocation in Dynamic Mechanism Design [57.66441610380448]
  We consider a problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds. The auctioneer aims to maximize their discounted overall revenue while adhering to a fairness constraint that guarantees a minimum average allocation for each group.
  arXiv  Detail & Related papers  (2024-05-31T19:26:05Z)
• Truthful Aggregation of LLMs with an Application to Online Advertising [11.552000005640203]
  We introduce MOSAIC, an auction mechanism that ensures that truthful reporting is a dominant strategy for advertisers. We show that MOSAIC leads to high advertiser value and platform revenue with low computational overhead.
  arXiv  Detail & Related papers  (2024-05-09T17:01:31Z)
• Auctions with LLM Summaries [13.797878055583531]
  We study an auction setting in which bidders bid for placement of their content within a summary generated by a large language model (LLM) We propose a novel factorized framework in which an auction module and an LLM module work together via a prediction model to provide welfare maximizing summary outputs.
  arXiv  Detail & Related papers  (2024-04-11T21:05:56Z)
• Online Advertisements with LLMs: Opportunities and Challenges [51.96140910798771]
  This paper explores the potential for leveraging Large Language Models (LLM) in the realm of online advertising systems. We introduce a general framework for LLM advertisement, consisting of modification, bidding, prediction, and auction modules.
  arXiv  Detail & Related papers  (2023-11-11T02:13:32Z)
• RTB Formulation Using Point Process [1.7132914341329852]
  We propose a general framework for modelling repeated auctions in the Real Time Bidding (RTB) ecosystem using point processes. We specify the player's optimal strategy under various scenarios. It is critical to consider the joint distribution of utility and market condition instead of estimating the marginal distributions independently.
  arXiv  Detail & Related papers  (2023-08-17T17:57:59Z)
• VFed-SSD: Towards Practical Vertical Federated Advertising [53.08038962443853]
  We propose a semi-supervised split distillation framework VFed-SSD to alleviate the two limitations. Specifically, we develop a self-supervised task MatchedPair Detection (MPD) to exploit the vertically partitioned unlabeled data. Our framework provides an efficient federation-enhanced solution for real-time display advertising with minimal deploying cost and significant performance lift.
  arXiv  Detail & Related papers  (2022-05-31T17:45:30Z)
• A Cooperative-Competitive Multi-Agent Framework for Auto-bidding in Online Advertising [53.636153252400945]
  We propose a general Multi-Agent reinforcement learning framework for Auto-Bidding, namely MAAB, to learn the auto-bidding strategies. Our approach outperforms several baseline methods in terms of social welfare and guarantees the ad platform's revenue.
  arXiv  Detail & Related papers  (2021-06-11T08:07:14Z)
• Neural Auction: End-to-End Learning of Auction Mechanisms for E-Commerce Advertising [42.7415188090209]
  We develop deep models to efficiently extract contexts from auctions, providing rich features for auction design. DNAs have been successfully deployed in the e-commerce advertising system at Taobao.
  arXiv  Detail & Related papers  (2021-06-07T13:20:40Z)
• ProportionNet: Balancing Fairness and Revenue for Auction Design with Deep Learning [55.76903822619047]
  We study the design of revenue-maximizing auctions with strong incentive guarantees. We extend techniques for approximating auctions using deep learning to address concerns of fairness while maintaining high revenue and strong incentive guarantees.
  arXiv  Detail & Related papers  (2020-10-13T13:54:21Z)
• A Game-Theoretic Analysis of the Empirical Revenue Maximization Algorithm with Endogenous Sampling [19.453243313852557]
  Empirical Revenue Maximization (ERM) is one of the most important price learning algorithms in auction design. We generalize the definition of an incentive-awareness measure proposed by Lavi et al to quantify the reduction of ERM's outputted price due to a change of $mge 1$ out of $N$ input samples. We construct an efficient, approximately incentive-compatible, and revenue-optimal learning algorithm using ERM in repeated auctions against non-myopic bidders, and show approximate group incentive-compatibility in uniform-price auctions.
  arXiv  Detail & Related papers  (2020-10-12T08:20:35Z)
• Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising [52.3825928886714]
  We formulate the sequential advertising strategy optimization as a dynamic knapsack problem. We propose a theoretically guaranteed bilevel optimization framework, which significantly reduces the solution space of the original optimization space. To improve the exploration efficiency of reinforcement learning, we also devise an effective action space reduction approach.
  arXiv  Detail & Related papers  (2020-06-29T18:50:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.