Online Causal Inference for Advertising in Real-Time Bidding Auctions

• URL: http://arxiv.org/abs/1908.08600v4
• Date: Mon, 26 Feb 2024 00:00:47 GMT
• Title: Online Causal Inference for Advertising in Real-Time Bidding Auctions
• Authors: Caio Waisman, Harikesh S. Nair, Carlos Carrion
• Abstract summary: This paper proposes a new approach to perform causal inference on advertising bought through real-time bidding systems. We first show that the effects of advertising are identified by the optimal bids. We introduce an adapted Thompson sampling (TS) algorithm to solve a multi-armed bandit problem.
• Score: 1.9336815376402723
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Real-time bidding (RTB) systems, which utilize auctions to allocate user impressions to competing advertisers, continue to enjoy success in digital advertising. Assessing the effectiveness of such advertising remains a challenge in research and practice. This paper proposes a new approach to perform causal inference on advertising bought through such mechanisms. Leveraging the economic structure of first- and second-price auctions, we first show that the effects of advertising are identified by the optimal bids. Hence, since these optimal bids are the only objects that need to be recovered, we introduce an adapted Thompson sampling (TS) algorithm to solve a multi-armed bandit problem that succeeds in recovering such bids and, consequently, the effects of advertising while minimizing the costs of experimentation. We derive a regret bound for our algorithm which is order optimal and use data from RTB auctions to show that it outperforms commonly used methods that estimate the effects of advertising.

Related papers

• Multi-Platform Budget Management in Ad Markets with Non-IC Auctions [6.037383467521294]
  In online advertising markets, budget-constrained advertisers acquire ad placements through repeated bidding in auctions on various platforms. We present a strategy for bidding optimally in a set of auctions that may or may not be incentive-compatible under the presence of budget constraints. Our strategy maximizes the expected total utility across auctions while satisfying the advertiser's budget constraints in expectation.
  arXiv  Detail & Related papers  (2023-06-12T18:21:10Z)
• Improving Real-Time Bidding in Online Advertising Using Markov Decision Processes and Machine Learning Techniques [0.0]
  This paper proposes a novel method for real-time bidding that combines deep learning and reinforcement learning techniques. The proposed method employs a deep neural network to predict auction details and market prices and a reinforcement learning algorithm to determine the optimal bid price. The outcomes demonstrate that the proposed method is preferable regarding cost-effectiveness and precision.
  arXiv  Detail & Related papers  (2023-05-05T14:34:20Z)
• 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)
• A Real-World Implementation of Unbiased Lift-based Bidding System [8.35120274877627]
  A typical Demand-Side Platform (DSP)bids based on the predicted probability of click and conversion right after an ad impression. Recent studies find such a strategy is suboptimal and propose a better bidding strategy named lift-based bidding. Lift-based bidding simply bids the price according to the lift effect of the ad impression and achieves target metrics such as sales.
  arXiv  Detail & Related papers  (2022-02-23T01:15:54Z)
• Bid Optimization using Maximum Entropy Reinforcement Learning [0.3149883354098941]
  This paper focuses on optimizing a single advertiser's bidding strategy using reinforcement learning (RL) in real-time bidding (RTB) We first utilize a widely accepted linear bidding function to compute every impression's base price and optimize it by a mutable adjustment factor derived from the RTB auction environment. Finally, the empirical study on a public dataset demonstrates that the proposed bidding strategy has superior performance compared with the baselines.
  arXiv  Detail & Related papers  (2021-10-11T06:53:53Z)
• 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)
• 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)
• 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)
• Do Interruptions Pay Off? Effects of Interruptive Ads on Consumers Willingness to Pay [79.9312329825761]
  We present the results of a study designed to measure the impact of interruptive advertising on consumers willingness to pay for products bearing the advertiser's brand. Our results contribute to the research on the economic impact of advertising, and introduce a method of measuring actual (as opposed to self-reported) willingness to pay in experimental marketing research.
  arXiv  Detail & Related papers  (2020-05-14T09:26:57Z)
• Online Joint Bid/Daily Budget Optimization of Internet Advertising Campaigns [115.96295568115251]
  We study the problem of automating the online joint bid/daily budget optimization of pay-per-click advertising campaigns over multiple channels. For every campaign, we capture the dependency of the number of clicks on the bid and daily budget by Gaussian Processes. We design four algorithms and show that they suffer from a regret that is upper bounded with high probability as O(sqrtT) We present the results of the adoption of our algorithms in a real-world application with a daily average spent of 1,000 Euros for more than one year.
  arXiv  Detail & Related papers  (2020-03-03T11:07:38Z)
• Adversarial Attacks on Linear Contextual Bandits [87.08004581867537]
  Malicious agents may have incentives to attack the bandit algorithm to induce it to perform a desired behavior. We show that a malicious agent can force a linear contextual bandit algorithm to pull any desired arm $T - o(T)$ times over a horizon of $T$ steps. We also investigate the case when a malicious agent is interested in affecting the behavior of the bandit algorithm in a single context.
  arXiv  Detail & Related papers  (2020-02-10T15:04:09Z)

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.