Privacy-Preserving Dynamic Personalized Pricing with Demand Learning

References

• Abowd JM (2018) The U.S. Census Bureau adopts differential privacy. Proc. 24th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 2867.Google Scholar
• Apple Differential Privacy Team (2017) Learning with privacy at scale. Technical report, Apple, Cupertino, CA.Google Scholar
• Araman VF, Caldentey R (2009) Dynamic pricing for nonperishable products with demand learning. Oper. Res. 57(5):1169–1188.Link, Google Scholar
• Ban G-Y, Keskin NB (2021) Personalized dynamic pricing with machine learning: High dimensional features and heterogeneous elasticity. Management Sci. Forthcoming.Link, Google Scholar
• Barbaro M, Zeller T Jr (2006) A face is exposed for AOL Searcher No. 4417749. New York Times (August 9), https://www.nytimes.com/2006/08/09/technology/09aol.html.Google Scholar
• Besbes O, Zeevi A (2009) Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms. Oper. Res. 57(6):1407–1420.Link, Google Scholar
• Besbes O, Zeevi A (2015) On the (surprising) sufficiency of linear models for dynamic pricing with demand learning. Management Sci. 61(4):723–739.Link, Google Scholar
• Broder J, Rusmevichientong P (2012) Dynamic pricing under a general parametric choice model. Oper. Res. 60(4):965–980.Link, Google Scholar
• Chan T-HH, Shi E, Song D (2011) Private and continual release of statistics. ACM Trans. Inform. System Security 14(3):1–24.Crossref, Google Scholar
• Chaudhuri K, Monteleoni C, Sarwate AD (2011) Differentially private empirical risk minimization. J. Machine Learn. Res. 12(3):1069–1109.Google Scholar
• Chen Q, Jasin S, Duenyas I (2015) Real-time dynamic pricing with minimal and flexible price adjustment. Management Sci. 62(8):2437–2455.Link, Google Scholar
• Chen L, Mislove A, Wilson C (2016) An empirical analysis of algorithmic pricing on Amazon Marketplace. Proc. 25th Internat. Conf. World Wide Web (International World Wide Web Conferences Steering Committee, Geneva), 1339–1349.Google Scholar
• Chen X, Owen Z, Pixton C, Simchi-Levi D (2021) A statistical learning approach to personalization in revenue management. Management Sci., ePub ahead of print January 18, https://doi.org/10.1287/mnsc.2020.3772.Google Scholar
• Cheung WC, Simchi-Levi D (2017) Thompson sampling for online personalized assortment optimization problems with multinomial logit choice models. Preprint, submitted November 27, http://dx.doi.org/10.2139/ssrn.3075658.Google Scholar
• Cheung WC, Simchi-Levi D, Wang H (2017) Dynamic pricing and demand learning with limited price experimentation. Oper. Res. 65(6):1722–1731.Link, Google Scholar
• Cohen MC, Lobel I, Paes Leme R (2020) Feature-based dynamic pricing. Management Sci. 66(11):4921–4943.Link, Google Scholar
• Dani V, Hayes TP, Kakade SM (2008) Stochastic linear optimization under bandit feedback. Proc. 21st Annual Conf. Learn. Theory (Association for Computational Learning, Sweden), 355–366.Google Scholar
• den Boer AV, Zwart B (2013) Simultaneously learning and optimizing using controlled variance pricing. Management Sci. 60(3):770–783.Link, Google Scholar
• Ding B, Kulkarni J, Yekhanin S (2017) Collecting telemetry data privately. Advances in Neural Information Processing Systems, vol. 30 (Curran Associates, Red Hook, NY), 3571–3580.Google Scholar
• Dong J, Roth A, Su WJ (2019) Gaussian differential privacy. Preprint, submitted May 7, https://arxiv.org/abs/1905.02383. Google Scholar
• Dwork C, Roth A (2014) The algorithmic foundations of differential privacy. Foundations Trends Theoret. Comput. Sci. 9(3–4):211–407.Crossref, Google Scholar
• Dwork C, McSherry F, Nissim K, Smith A (2006a) Calibrating noise to sensitivity in private data analysis. Halevi S, Rabin T, eds. Theory Cryptography Conf. (Springer, Berlin), 265–284.Google Scholar
• Dwork C, Naor M, Pitassi T, Rothblum GN (2010) Differential privacy under continual observation. Proc. 42nd Annual ACM Sympos. Theory Comput. (ACM, New York), 715–724.Google Scholar
• Dwork C, Talwar K, Thakurta A, Zhang L (2014) Analyze Gauss: Optimal bounds for privacy-preserving principal component analysis. Proc. 46th Annual ACM Sympos. Theory Comput. (ACM, New York), 11–20.Google Scholar
• Dwork C, Kenthapadi K, McSherry F, Mironov I, Naor M (2006b) Our data, ourselves: Privacy via distributed noise generation. Vaudenay S, ed. Adv. Cryptology: Annual Internat. Conf. Theory Appl. Cryptographic Techniques (Springer, Berlin), 486–503.Google Scholar
• Erlingsson Ú, Pihur V, Korolova A (2014) RAPPOR: Randomized aggregatable privacy-preserving ordinal response. Proc. 2014 ACM SIGSAC Conf. Comput. Comm. Security (ACM, New York), 1054–1067.Google Scholar
• Evfimievski A, Gehrke J, Srikant R (2003) Limiting privacy breaches in privacy preserving data mining. Proc. 22nd ACM SIGMOD-SIGACT-SIGART Sympos. Principles Database Systems (ACM, New York), 211–222.Google Scholar
• Farias VF, Van Roy B (2010) Dynamic pricing with a prior on market response. Oper. Res. 58(1):16–29.Link, Google Scholar
• Ferreira KJ, Simchi-Levi D, Wang H (2018) Online network revenue management using Thompson sampling. Oper. Res. 66(6):1586–1602.Link, Google Scholar
• Filippi S, Cappe O, Garivier A, Szepesvári C (2010) Parametric bandits: The generalized linear case. Lafferty J, Williams C, Shawe-Taylor J, Zemel R, Culotta A, eds. Advances in Neural Information Processing Systems, vol. 23 (Curran Associates, Red Hook, NY), 586–594.Google Scholar
• Hannak A, Soeller G, Lazer D, Mislove A, Wilson C (2014) Measuring price discrimination and steering on e-commerce web sites. Proc. 2014 Internet Measurement Conf. (ACM, New York), 305–318.Google Scholar
• Harrison JM, Keskin NB, Zeevi A (2012) Bayesian dynamic pricing policies: Learning and earning under a binary prior distribution. Management Sci. 58(3):570–586.Link, Google Scholar
• Javanmard A, Nazerzadeh H (2019) Dynamic pricing in high-dimensions. J. Machine Learn. Res. 20(9):1–49.Google Scholar
• Kasiviswanathan SP, Lee HK, Nissim K, Raskhodnikova S, Smith A (2011) What can we learn privately? SIAM J. Comput. 40(3):793–826.Crossref, Google Scholar
• Kifer D, Smith A, Thakurta A (2012) Private convex empirical risk minimization and high-dimensional regression. Proc. 25th Annual Conf. Learn. Theory, JMLR Workshop and Conference Proceedings, vol. 23 (Association for Computational Learning, Scotland), 25.1–25.40.Google Scholar
• Lei YM, Miao S, Momot R (2020) Privacy-preserving personalized revenue management. HEC Paris Research Paper MOSI-2020-1391, HEC Paris, Jouy en Josas, France.Google Scholar
• Li L, Lu Y, Zhou D (2017) Provably optimal algorithms for generalized linear contextual bandits. Proc. 34th Internat. Conf. Machine Learn. (PMLR, Australia), 2071–2080.Google Scholar
• Linden G, Smith B, York J (2003) Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Comput. 7(1):76–80.Crossref, Google Scholar
• Miao S, Chen X, Chao X, Liu J, Zhang Y (2019) Context-based dynamic pricing with online clustering. Preprint, submitted November 1, https://arxiv.org/abs/1902.06199.Google Scholar
• Mishra N, Thakurta A (2015) (Nearly) optimal differentially private stochastic multi-arm bandits. Meila M, Heskes T, eds. Proc. 31st Conf. Uncertainty Artificial Intelligence (AUAI Press, Arlington, VA), 592–601.Google Scholar
• Mohammed R (2017) How retailers use personalized prices to test what you’re willing to pay. Harvard Bus. Rev. (October 20), https://hbr.org/2017/10/how-retailers-use-personalized-prices-to-test-what-youre-willing-to-pay.Google Scholar
• Narayanan A, Shmatikov V (2008) Robust de-anonymization of large sparse datasets. Proc. IEEE Sympos. Security Privacy (IEEE Computer Society, Washington, DC), 111–125. Google Scholar
• Qiang S, Bayati M (2016) Dynamic pricing with demand covariates. Preprint, submitted June 1, http://dx.doi.org/10.2139/ssrn.2765257.Google Scholar
• Ren W, Zhou X, Liu J, Shroff NB (2020) Multi-armed bandits with local differential privacy. Preprint, submitted July 6, https://arxiv.org/abs/2007.03121.Google Scholar
• Shariff R, Sheffet O (2018) Differentially private contextual linear bandits. Bengio S, Wallach H, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R, eds. Advances in Neural Information Processing Systems, vol. 31 (Curran Associates, Red Hook, NY), 4296–4306.Google Scholar
• Tang W, Ho C-J, Liu Y (2020) Differentially private contextual dynamic pricing. Proc. 19th Internat. Conf. Autonomous Agents MultiAgent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 1368–1376.Google Scholar
• Tringale M (2018) Dynamic pricing vs. personalized pricing, what’s the difference? Wiser (blog), July 5, https://blog.wiser.com/dynamic-pricing-vs-personalized-pricing-whats-the-difference/.Google Scholar
• Tsitsiklis J, Xu K, Xu Z (2021) Private sequential learning. Oper. Res., ePub ahead of print January 14, https://doi.org/10.1287/opre.2020.2021.Link, Google Scholar
• Wang Y-X (2019) Per-instance differential privacy. J. Privacy Confidentiality 9(1), https://doi.org/10.29012/jpc.662.Crossref, Google Scholar
• Wang Z, Deng S, Ye Y (2014) Close the gaps: A learning-while-doing algorithm for single-product revenue management problems. Oper. Res. 62(2):318–331.Link, Google Scholar
• Wang Y-X, Lei J, Fienberg SE (2016) On-average KL-privacy and its equivalence to generalization for max-entropy mechanisms. Domingo-Ferrer J, Pejić-Bach M, eds. Proc. Internat. Conf. Privacy Statist. Databases (Springer, Cham, Switzerland), 121–134.Crossref, Google Scholar
• Wang Y, Chen X, Chang X, Ge D (2020) Uncertainty quantification for demand prediction in contextual dynamic pricing. Production Oper. Management, ePub ahead of print December 9, https://doi.org/10.1111/poms.13337.Google Scholar
• Wang Y, Wang R, Du SS, Krishnamurthy A (2019) Optimism in reinforcement learning with generalized linear function approximation. Preprint, submitted December 9, https://arxiv.org/abs/1912.04136.Google Scholar
• Xu K (2018) Query complexity of Bayesian private learning. Bengio S, Wallach H, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R, eds. Advances in Neural Information Processing Systems, vol. 31 (Curran Associates, Red Hook, NY), 2431–2440.Google Scholar
• Xu J, Xu K, Yang D (2020) Optimal query complexity for private sequential learning against eavesdropping. Preprint, submitted August 17, https://arxiv.org/abs/1909.09836.Google Scholar
• Zheng K, Cai T, Huang W, Li Z, Wang L (2020) Locally differentially private (contextual) bandits learning. Larochelle H, Ranzato M, Hadsell R, Balcan MF, Lin H, eds. Advances in Neural Information Processing Systems, vol. 33 (Curran Associates, Red Hook, NY), 12300–12310.Google Scholar