User Response in Ad Auctions: An MDP Formulation of Long-Term Revenue Optimization

• URL: http://arxiv.org/abs/2302.08108v2
• Date: Mon, 6 May 2024 00:07:40 GMT
• Title: User Response in Ad Auctions: An MDP Formulation of Long-Term Revenue Optimization
• Authors: Yang Cai, Zhe Feng, Christopher Liaw, Aranyak Mehta, Grigoris Velegkas,
• Abstract summary: We propose a new Markov Decision Process model for ad auctions to capture the user response to the quality of ads. By incorporating user response, our model takes into consideration all three parties involved in the auction (advertiser, auctioneer, and user)
• Score: 13.868805489082701
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a new Markov Decision Process (MDP) model for ad auctions to capture the user response to the quality of ads, with the objective of maximizing the long-term discounted revenue. By incorporating user response, our model takes into consideration all three parties involved in the auction (advertiser, auctioneer, and user). The state of the user is modeled as a user-specific click-through rate (CTR) with the CTR changing in the next round according to the set of ads shown to the user in the current round. We characterize the optimal mechanism for this MDP as a Myerson's auction with a notion of modified virtual value, which relies on the value distribution of the advertiser, the current user state, and the future impact of showing the ad to the user. Leveraging this characterization, we design a sample-efficient and computationally-efficient algorithm which outputs an approximately optimal policy that requires only sample access to the true MDP and the value distributions of the bidders. Finally, we propose a simple mechanism built upon second price auctions with personalized reserve prices and show it can achieve a constant-factor approximation to the optimal long term discounted revenue.

Related papers

• Procurement Auctions via Approximately Optimal Submodular Optimization [53.93943270902349]
  We study procurement auctions, where an auctioneer seeks to acquire services from strategic sellers with private costs. Our goal is to design computationally efficient auctions that maximize the difference between the quality of the acquired services and the total cost of the sellers.
  arXiv  Detail & Related papers  (2024-11-20T18:06:55Z)
• 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)
• Know in AdVance: Linear-Complexity Forecasting of Ad Campaign Performance with Evolving User Interest [31.40023913908308]
  Real-time Bidding (RTB) advertisers wish to textitknow in advance the expected cost and yield of ad campaigns to avoid trial-and-error expenses. We propose textitAdVance, a time-aware framework that integrates local auction-level and global campaign-level modeling. AdVance has been deployed on the Tencent Advertising platform, and A/B tests show a remarkable 4.5% uplift in Average Revenue per User (ARPU)
  arXiv  Detail & Related papers  (2024-05-17T10:22:36Z)
• Enhancing User Intent Capture in Session-Based Recommendation with Attribute Patterns [77.19390850643944]
  We propose the Frequent Attribute Pattern Augmented Transformer (FAPAT) FAPAT characterizes user intents by building attribute transition graphs and matching attribute patterns. We demonstrate that FAPAT consistently outperforms state-of-the-art methods by an average of 4.5% across various evaluation metrics.
  arXiv  Detail & Related papers  (2023-12-23T03:28:18Z)
• Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model [50.06663781566795]
  We consider a dynamic model with the consumers' preferences as well as price sensitivity varying over time. We measure the performance of a dynamic pricing policy via regret, which is the expected revenue loss compared to a clairvoyant that knows the sequence of model parameters in advance. Our regret analysis results not only demonstrate optimality of the proposed policy but also show that for policy planning it is essential to incorporate available structural information.
  arXiv  Detail & Related papers  (2023-03-28T00:23:23Z)
• Demystifying Advertising Campaign Bid Recommendation: A Constraint target CPA Goal Optimization [19.857681941728597]
  This paper presents a bid optimization scenario to achieve the desired cost-per-acquisition (tCPA) goals for advertisers. We build the optimization engine to make a decision by solving the rigorously formalized constrained optimization problem. The proposed model can naturally recommend the bid that meets the advertisers' expectations by making inference over advertisers' historical auction behaviors.
  arXiv  Detail & Related papers  (2022-12-26T07:43:26Z)
• PinnerFormer: Sequence Modeling for User Representation at Pinterest [60.335384724891746]
  We introduce PinnerFormer, a user representation trained to predict a user's future long-term engagement. Unlike prior approaches, we adapt our modeling to a batch infrastructure via our new dense all-action loss. We show that by doing so, we significantly close the gap between batch user embeddings that are generated once a day and realtime user embeddings generated whenever a user takes an action.
  arXiv  Detail & Related papers  (2022-05-09T18:26:51Z)
• CAMTA: Causal Attention Model for Multi-touch Attribution [25.258282793367453]
  We propose CAMTA, a novel deep recurrent neural network architecture which is a casual attribution mechanism for user-personalised MTA. We demonstrate the superior performance of CAMTA with respect to prediction accuracy as compared to several baselines.
  arXiv  Detail & Related papers  (2020-12-21T15:05:00Z)
• A novel auction system for selecting advertisements in Real-Time bidding [68.8204255655161]
  Real-Time Bidding is a new Internet advertising system that has become very popular in recent years. We propose an alternative betting system with a new approach that not only considers the economic aspect but also other relevant factors for the functioning of the advertising system.
  arXiv  Detail & Related papers  (2020-10-22T18:36:41Z)
• Real-Time Optimization Of Web Publisher RTB Revenues [10.908037452134302]
  This paper describes an engine to optimize web publisher revenues from second-price auctions. The engine is able to predict, for each auction, an optimal reserve price in approximately one millisecond.
  arXiv  Detail & Related papers  (2020-06-12T11:14:56Z)
• Maximizing Cumulative User Engagement in Sequential Recommendation: An Online Optimization Perspective [26.18096797120916]
  It is often needed to tradeoff two potentially conflicting objectives, that is, pursuing higher immediate user engagement and encouraging user browsing. We propose a flexible and practical framework to explicitly tradeoff longer user browsing length and high immediate user engagement. This approach is deployed at a large E-commerce platform, achieved over 7% improvement of cumulative clicks.
  arXiv  Detail & Related papers  (2020-06-02T09:02:51Z)

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.