Revenue Maximization and Learning in Products Ranking

• URL: http://arxiv.org/abs/2012.03800v1
• Date: Mon, 7 Dec 2020 15:41:57 GMT
• Title: Revenue Maximization and Learning in Products Ranking
• Authors: Ningyuan Chen, Anran Li, Shuoguang Yang
• Abstract summary: We consider the revenue problem for an online retailer who plans to display a set of products differing in their prices and qualities and rank them in order order. The consumers have random attention spans and view the products sequentially purchasing a satificsing'' product or leaving the platform empty-handed when the attention span gets exhausted. Our framework extends the cascade model in two directions: the consumers have random attention spans instead of fixed ones and the firm maximizes revenues instead of clicking probabilities.
• Score: 1.7403133838762448
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the revenue maximization problem for an online retailer who plans to display a set of products differing in their prices and qualities and rank them in order. The consumers have random attention spans and view the products sequentially before purchasing a ``satisficing'' product or leaving the platform empty-handed when the attention span gets exhausted. Our framework extends the cascade model in two directions: the consumers have random attention spans instead of fixed ones and the firm maximizes revenues instead of clicking probabilities. We show a nested structure of the optimal product ranking as a function of the attention span when the attention span is fixed and design a $1/e$-approximation algorithm accordingly for the random attention spans. When the conditional purchase probabilities are not known and may depend on consumer and product features, we devise an online learning algorithm that achieves $\tilde{\mathcal{O}}(\sqrt{T})$ regret relative to the approximation algorithm, despite of the censoring of information: the attention span of a customer who purchases an item is not observable. Numerical experiments demonstrate the outstanding performance of the approximation and online learning algorithms.

Related papers

• Long-Sequence Recommendation Models Need Decoupled Embeddings [49.410906935283585]
  We identify and characterize a neglected deficiency in existing long-sequence recommendation models. A single set of embeddings struggles with learning both attention and representation, leading to interference between these two processes. We propose the Decoupled Attention and Representation Embeddings (DARE) model, where two distinct embedding tables are learned separately to fully decouple attention and representation.
  arXiv  Detail & Related papers  (2024-10-03T15:45:15Z)
• A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
  We address the problem of dynamically pricing complementary items that are sequentially displayed to customers. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
  arXiv  Detail & Related papers  (2024-07-08T09:55:31Z)
• Dynamic Pricing and Learning with Bayesian Persuasion [18.59029578133633]
  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.
  arXiv  Detail & Related papers  (2023-04-27T17:52:06Z)
• Product Ranking for Revenue Maximization with Multiple Purchases [29.15026863056805]
  We propose an optimal ranking policy when the online retailer can precisely model consumers' behaviors. We develop the Multiple-Purchase-with-Budget UCB algorithms with $O(sqrtT)$ regret. Experiments on both synthetic and semi-synthetic datasets prove the effectiveness of the proposed algorithms.
  arXiv  Detail & Related papers  (2022-10-15T11:59:45Z)
• Modeling Content Creator Incentives on Algorithm-Curated Platforms [76.53541575455978]
  We study how algorithmic choices affect the existence and character of (Nash) equilibria in exposure games. We propose tools for numerically finding equilibria in exposure games, and illustrate results of an audit on the MovieLens and LastFM datasets.
  arXiv  Detail & Related papers  (2022-06-27T08:16:59Z)
• Personalized Entity Resolution with Dynamic Heterogeneous Knowledge Graph Representations [40.37976161857134]
  We propose a new framework that leverages personalized features to improve the accuracy of product ranking. We first build a cross-source heterogeneous knowledge graph from customer purchase history and product knowledge graph to jointly learn customer and product embeddings. After that, we incorporate product, customer, and history representations into a neural reranking model to predict which candidate is most likely to be purchased for a specific customer.
  arXiv  Detail & Related papers  (2021-04-06T16:58:27Z)
• Regret in Online Recommendation Systems [73.58127515175127]
  This paper proposes a theoretical analysis of recommendation systems in an online setting, where items are sequentially recommended to users over time. In each round, a user, randomly picked from a population of $m$ users, requests a recommendation. The decision-maker observes the user and selects an item from a catalogue of $n$ items. The performance of the recommendation algorithm is captured through its regret, considering as a reference an Oracle algorithm aware of these probabilities.
  arXiv  Detail & Related papers  (2020-10-23T12:48:35Z)
• 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)
• Learning Robust Models for e-Commerce Product Search [23.537201383165755]
  Showing items that do not match search query intent degrades customer experience in e-commerce. Mitigating the problem requires a large labeled dataset. We develop a deep, end-to-end model that learns to effectively classify mismatches.
  arXiv  Detail & Related papers  (2020-05-07T17:22:21Z)
• Ranking a set of objects: a graph based least-square approach [70.7866286425868]
  We consider the problem of ranking $N$ objects starting from a set of noisy pairwise comparisons provided by a crowd of equal workers. We propose a class of non-adaptive ranking algorithms that rely on a least-squares intrinsic optimization criterion for the estimation of qualities.
  arXiv  Detail & Related papers  (2020-02-26T16:19:09Z)
• Assortment Optimization with Repeated Exposures and Product-dependent Patience Cost [19.29174615532181]
  We study the assortment optimization problem faced by many online retailers such as Amazon. We develop a multinomial logit model to capture the consumers' purchasing behavior across multiple stages.
  arXiv  Detail & Related papers  (2020-02-13T03:12:49Z)

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.