Dynamic Pricing and Learning with Bayesian Persuasion

• URL: http://arxiv.org/abs/2304.14385v2
• Date: Sun, 10 Dec 2023 22:39:36 GMT
• Title: Dynamic Pricing and Learning with Bayesian Persuasion
• Authors: Shipra Agrawal, Yiding Feng, Wei Tang
• Abstract summary: We consider a novel dynamic pricing and learning setting where in addition to setting prices of products, the seller also ex-ante commits to 'advertising schemes' We use the popular Bayesian persuasion framework to model the effect of these signals on the buyers' valuation and purchase responses. We design an online algorithm that can use past purchase responses to adaptively learn the optimal pricing and advertising strategy.
• Score: 18.59029578133633
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: We consider a novel dynamic pricing and learning setting where in addition to setting prices of products in sequential rounds, the seller also ex-ante commits to 'advertising schemes'. That is, in the beginning of each round the seller can decide what kind of signal they will provide to the buyer about the product's quality upon realization. Using the popular Bayesian persuasion framework to model the effect of these signals on the buyers' valuation and purchase responses, we formulate the problem of finding an optimal design of the advertising scheme along with a pricing scheme that maximizes the seller's expected revenue. Without any apriori knowledge of the buyers' demand function, our goal is to design an online algorithm that can use past purchase responses to adaptively learn the optimal pricing and advertising strategy. We study the regret of the algorithm when compared to the optimal clairvoyant price and advertising scheme. Our main result is a computationally efficient online algorithm that achieves an $O(T^{2/3}(m\log T)^{1/3})$ regret bound when the valuation function is linear in the product quality. Here $m$ is the cardinality of the discrete product quality domain and $T$ is the time horizon. This result requires some natural monotonicity and Lipschitz assumptions on the valuation function, but no Lipschitz or smoothness assumption on the buyers' demand function. For constant $m$, our result matches the regret lower bound for dynamic pricing within logarithmic factors, which is a special case of our problem. We also obtain several improved results for the widely considered special case of additive valuations, including an $\tilde{O}(T^{2/3})$ regret bound independent of $m$ when $m\le T^{1/3}$.

Related papers

• A Multimodal Analysis of Influencer Content on Twitter [40.41635575764701]
  Line between personal opinions and commercial content promotion is frequently blurred. This makes automatic detection of regulatory compliance breaches related to influencer advertising difficult. We introduce a new Twitter (now X) dataset consisting of 15,998 influencer posts mapped into commercial and non-commercial categories.
  arXiv  Detail & Related papers  (2023-09-06T15:07:23Z)
• Incrementality Bidding and Attribution [0.4511923587827302]
  In digital advertising three major puzzle pieces are central to quantifying advertising incrementality: ad buying/bidding/pricing, attribution, and experimentation. We propose a methodology that unifies these three concepts into a computationally viable model of both bidding and attribution.
  arXiv  Detail & Related papers  (2022-08-25T18:33:08Z)
• Persuasion Strategies in Advertisements [68.70313043201882]
  We introduce an extensive vocabulary of persuasion strategies and build the first ad image corpus annotated with persuasion strategies. We then formulate the task of persuasion strategy prediction with multi-modal learning. We conduct a real-world case study on 1600 advertising campaigns of 30 Fortune-500 companies.
  arXiv  Detail & Related papers  (2022-08-20T07:33:13Z)
• Personality-Driven Social Multimedia Content Recommendation [68.46899477180837]
  We investigate the impact of human personality traits on the content recommendation model by applying a novel personality-driven multi-view content recommender system. Our experimental results and real-world case study demonstrate not just PersiC's ability to perform efficient human personality-driven multi-view content recommendation, but also allow for actionable digital ad strategy recommendations.
  arXiv  Detail & Related papers  (2022-07-25T14:37:18Z)
• Aspect-based Analysis of Advertising Appeals for Search Engine Advertising [37.85305426549587]
  We focus on exploring the effective A$3$ for different industries with the aim of assisting the ad creation process. Our experiments demonstrated that different industries have their own effective A$3$ and that the identification of the A$3$ contributes to the estimation of advertising performance.
  arXiv  Detail & Related papers  (2022-04-25T05:31:07Z)
• 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)
• Online-to-Offline Advertisements as Field Experiments [0.17877823660518105]
  We study the difference in offline behavior between customers who received online advertisements and regular customers. We then find a long-run effect of this externality of advertising that a certain portion of the customers invited to the offline shops revisit these shops.
  arXiv  Detail & Related papers  (2020-10-18T22:04:56Z)
• Learning to Infer User Hidden States for Online Sequential Advertising [52.169666997331724]
  We propose our Deep Intents Sequential Advertising (DISA) method to address these issues. The key part of interpretability is to understand a consumer's purchase intent which is, however, unobservable (called hidden states)
  arXiv  Detail & Related papers  (2020-09-03T05:12:26Z)
• A Deep Prediction Network for Understanding Advertiser Intent and Satisfaction [41.000912016821246]
  We propose a novel Deep Satisfaction Prediction Network (DSPN), which models advertiser intent and satisfaction simultaneously. Our proposed DSPN outperforms state-of-the-art baselines and has stable performance in terms of AUC in the online environment.
  arXiv  Detail & Related papers  (2020-08-20T15:08:50Z)
• 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)

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.