Privacy-Preserving Dynamic Personalized Pricing with Demand Learning PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Privacy-Preserving Dynamic Personalized Pricing with Demand Learning PDF full book. Access full book title Privacy-Preserving Dynamic Personalized Pricing with Demand Learning by Chen, Xi. Download full books in PDF and EPUB format.
Author: Chen, Xi
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Get Book Here
Book Description
Author: Chen, Xi
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Get Book Here
Book Description
Author: Xi Chen
Publisher: Springer Nature
ISBN: 3031019261
Category : Business & Economics
Languages : en
Pages : 444
Get Book Here
Book Description
This book examines recent developments in Operations Management, and focuses on four major application areas: dynamic pricing, assortment optimization, supply chain and inventory management, and healthcare operations. Data-driven optimization in which real-time input of data is being used to simultaneously learn the (true) underlying model of a system and optimize its performance, is becoming increasingly important in the last few years, especially with the rise of Big Data.
Author: Isaac Sserwanga
Publisher: Springer Nature
ISBN: 3031578503
Category : Artificial intelligence
Languages : en
Pages : 451
Get Book Here
Book Description
The Three-volume set LNCS 14596, 14596 and 14598 constitutes the proceedings of the 19th International Conference on Wisdom, Well-Being, Win-Win, iConference 2024, which was hosted virtually by University of Tsukuba, Japan and in presence by Jilin University, Changchun, China, during April 15–26, 2024. The 36 full papers and 55 short papers are presented in these proceedings were carefully reviewed and selected from 218 submissions. The papers are organized in the following topical sections: Volume I: Archives and Information Sustainability; Behavioural Research; AI and Machine Learning; Information Science and Data Science; Information and Digital Literacy. Volume II: Digital Humanities; Intellectual Property Issues; Social Media and Digital Networks; Disinformation and Misinformation; Libraries, Bibliometrics and Metadata. Volume III: Knowledge Management; Information Science Education; Information Governance and Ethics; Health Informatics; Human-AI Collaboration; Information Retrieval; Community Informatics; Scholarly, Communication and Open Access. .
Author: Ningyuan Chen
Publisher:
ISBN:
Category :
Languages : en
Pages : 41
Get Book Here
Book Description
We consider the problem of a firm seeking to use personalized pricing to sell an exogenously given stock of a product over a finite selling horizon to different consumer types. We assume that the type of an arriving consumer can be observed but the demand function associated with each type is initially unknown. The firm sets personalized prices dynamically for each type and attempts to maximize the revenue over the season. We provide a learning algorithm that is near-optimal when the demand and capacity scale in proportion. The algorithm utilizes the primal-dual formulation of the problem and learns the dual optimal solution explicitly. It allows the algorithm to overcome the curse of dimensionality (the rate of regret is independent of the number of types) and sheds light on novel algorithmic designs for learning problems with resource constraints.
Author: Wang Chi Cheung
Publisher:
ISBN:
Category :
Languages : en
Pages : 30
Get Book Here
Book Description
In a dynamic pricing problem where the demand function is not known a priori, price experimentation can be used as a demand learning tool. Existing literature usually assumes no constraint on price changes, but in practice sellers often face business constraints that prevent them from conducting extensive experimentation. We consider a dynamic pricing model where the demand function is unknown but belongs to a known finite set. The seller is allowed to make at most m price changes during T periods. The objective is to minimize the worst case regret, i.e., the expected total revenue loss compared to a clairvoyant who knows the demand distribution in advance. We demonstrate a pricing policy that incurs a regret of O(log^(m) T), or m iterations of the logarithm. Furthermore, we describe an implementation at Groupon, a large e-commerce marketplace for daily deals. The field study shows significant impact on revenue and bookings.
Author: Arnoud den Boer
Publisher:
ISBN:
Category :
Languages : en
Pages : 75
Get Book Here
Book Description
We consider a seller's dynamic pricing problem with demand learning and reference effects. We first study the case where customers are loss-averse: they have a reference price that can vary over time, and the demand reduction when the selling price exceeds the reference price dominates the demand increase when the selling price falls behind the reference price by the same amount. Thus, the expected demand as a function of price has a time-varying "kink" and is not differentiable everywhere. The seller neither knows the underlying demand function nor observes the time-varying reference prices. In this setting, we design and analyze a policy that (i) changes the selling price very slowly to control the evolution of the reference price, and (ii) gradually accumulates sales data to balance the tradeoff between learning and earning. We prove that, under a variety of reference-price updating mechanisms, our policy is asymptotically optimal; i.e., its T-period revenue loss relative to a clairvoyant who knows the demand function and the reference-price updating mechanism grows at the smallest possible rate in T. We also extend our analysis to the case of a fixed reference price, and show how reference effects increase the complexity of dynamic pricing with demand learning in this case. Moreover, we study the case where customers are gain-seeking and design asymptotically optimal policies for this case. Finally, we design and analyze an asymptotically optimal statistical test for detecting whether customers are loss-averse or gain-seeking.
Author: Chen, Xi
Publisher:
ISBN:
Category :
Languages : en
Pages : 51
Get Book Here
Book Description
This paper studies the dynamic pricing problem under model mis-specifi cation settings. To characterize the model mis-specification, we extend the "eps-contamination model | the most fundamental model in robust statistics and machine learning, to the online setting. In particular, for a selling horizon of length T, the online "eps-contamination model assumes that the demands are realized according to a typical unknown demand function only for (1-eps)T periods. For the rest of eps T periods, an outlier purchase can happen with arbitrary demand functions. Under this model, we develop new robust dynamic pricing policies to hedge against outlier purchase behavior. For the dynamic pricing problem, there are two critical prices, the revenue-maximizing price and inventory clearance price, and the optimal price is the larger price. The challenge is that the seller has no information about which price is larger, and the revenues near these two prices behave entirely differently. To address this challenge, we propose robust online policies for both cases when the optimal price is the revenue-maximizing price and when the optimal price is the clearance price, and then develop a meta algorithm that combines these two cases. Our algorithm is a fully adaptive policy that does not require any prior knowledge of the outlier proportion parameter ". Our simulation study shows that our policy outperforms existing policies in the literature.
Author: Maxime C. Cohen
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Get Book Here
Book Description
Following the increasing popularity of personalized pricing, there is a growing concern from customers and policy makers regarding fairness considerations. This paper studies the problem of dynamic pricing with unknown demand under two types of fairness constraints: price fairness and demand fairness. For price fairness, the retailer is required to (i) set similar prices for different customer groups (called group fairness) and (ii) ensure that the prices over time for each customer group are relatively stable (called time fairness). We propose an algorithm based on an infrequently-changed upper-confidence-bound (UCB) method, which is proved to yield a near-optimal regret performance. In particular, we show that imposing group fairness does not affect the demand learning problem, in contrast to imposing time fairness. On the flip side, we show that imposing time fairness does not impact the clairvoyant optimal revenue, in contrast to imposing group fairness. For demand fairness, the retailer is required to satisfy that the resulting demand from different customer groups is relatively similar (e.g., the retailer offers a lower price to students to increase their demand to a similar level as non-students). In this case, we design an algorithm adapted from a primal-dual learning framework and prove that our algorithm also achieves a near-optimal performance.
Author: Gah-Yi Ban
Publisher:
ISBN:
Category :
Languages : en
Pages : 53
Get Book Here
Book Description
We consider a seller who can dynamically adjust the price of a product at the individual customer level, by utilizing information about customers' characteristics encoded as a d-dimensional feature vector. We assume a personalized demand model, parameters of which depend on s out of the d features. The seller initially does not know the relationship between the customer features and the product demand, but learns this through sales observations over a selling horizon of T periods. We prove that the seller's expected regret, i.e., the revenue loss against a clairvoyant who knows the underlying demand relationship, is at least of order s √T under any admissible policy. We then design a near-optimal pricing policy for a “semi-clairvoyant” seller (who knows which s of the d features are in the demand model) that achieves an expected regret of order s √Tlog T. We extend this policy to a more realistic setting where the seller does not know the true demand predictors, and show that this policy has an expected regret of order s √T(log d+logT), which is also near-optimal. Finally, we test our theory on simulated data and on a data set from an online auto loan company in the United States. On both data sets, our experimentation-based pricing policy is superior to intuitive and/or widely-practiced customized pricing methods such as myopic pricing and segment-then- optimize policies. Furthermore, our policy improves upon the loan company's historical pricing decisions by 47% in expected revenue over a six-month period.
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
