Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Contextual Dynamic Pricing with Strategic Buyers (2307.04055v2)

Published 8 Jul 2023 in stat.ML, cs.AI, cs.GT, and cs.LG

Abstract: Personalized pricing, which involves tailoring prices based on individual characteristics, is commonly used by firms to implement a consumer-specific pricing policy. In this process, buyers can also strategically manipulate their feature data to obtain a lower price, incurring certain manipulation costs. Such strategic behavior can hinder firms from maximizing their profits. In this paper, we study the contextual dynamic pricing problem with strategic buyers. The seller does not observe the buyer's true feature, but a manipulated feature according to buyers' strategic behavior. In addition, the seller does not observe the buyers' valuation of the product, but only a binary response indicating whether a sale happens or not. Recognizing these challenges, we propose a strategic dynamic pricing policy that incorporates the buyers' strategic behavior into the online learning to maximize the seller's cumulative revenue. We first prove that existing non-strategic pricing policies that neglect the buyers' strategic behavior result in a linear $\Omega(T)$ regret with $T$ the total time horizon, indicating that these policies are not better than a random pricing policy. We then establish that our proposed policy achieves a sublinear regret upper bound of $O(\sqrt{T})$. Importantly, our policy is not a mere amalgamation of existing dynamic pricing policies and strategic behavior handling algorithms. Our policy can also accommodate the scenario when the marginal cost of manipulation is unknown in advance. To account for it, we simultaneously estimate the valuation parameter and the cost parameter in the online pricing policy, which is shown to also achieve an $O(\sqrt{T})$ regret bound. Extensive experiments support our theoretical developments and demonstrate the superior performance of our policy compared to other pricing policies that are unaware of the strategic behaviors.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (42)
  1. Amin, K., Rostamizadeh, A., and Syed, U. (2014), “Repeated Contextual Auctions with Strategic Buyers,” in Advances in Neural Information Processing Systems, eds. Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N., and Weinberger, K., Curran Associates, Inc., vol. 27.
  2. Ban, G.-Y. and Keskin, N. B. (2021), “Personalized Dynamic Pricing with Machine Learning: High-Dimensional Features and Heterogeneous Elasticity,” Management Science, 67, 5549–5568.
  3. Bastani, H., Simchi-Levi, D., and Zhu, R. (2022), “Meta Dynamic Pricing: Transfer Learning Across Experiments,” Management Science, 68, 1865–1881.
  4. Bechavod, Y., Ligett, K., Wu, S., and Ziani, J. (2021), “Gaming Helps! Learning from Strategic Interactions in Natural Dynamics,” in Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, eds. Banerjee, A. and Fukumizu, K., PMLR, vol. 130 of Proceedings of Machine Learning Research, pp. 1234–1242.
  5. Bechavod, Y., Podimata, C., Wu, S., and Ziani, J. (2022), “Information Discrepancy in Strategic Learning,” in Proceedings of the 39th International Conference on Machine Learning, eds. Chaudhuri, K., Jegelka, S., Song, L., Szepesvari, C., Niu, G., and Sabato, S., PMLR, vol. 162 of Proceedings of Machine Learning Research, pp. 1691–1715.
  6. Behera, R. K. and Bala, P. K. (2023), “Unethical use of information access and analytics in B2B service organisations: The dark side of behavioural loyalty,” Industrial Marketing Management, 109, 14–31.
  7. Broder, J. and Rusmevichientong, P. (2012), “Dynamic Pricing Under a General Parametric Choice Model,” Operations Research, 60, 965–980.
  8. Bó, I., Chen, L., and Hakimov, R. (2023), “Strategic Responses to Personalized Pricing and Demand for Privacy: An Experiment,” arXiv preprint arXiv:2304.11415.
  9. Błaszczyński, J., de Almeida Filho, A. T., Matuszyk, A., Szeląg, M., and Słowiński, R. (2021), “Auto loan fraud detection using dominance-based rough set approach versus machine learning methods,” Expert Systems with Applications, 163, 113740.
  10. Chen, X., Gao, J., Ge, D., and Wang, Z. (2022), “Bayesian dynamic learning and pricing with strategic customers,” Production and Operations Management, 31, 3125–3142.
  11. Chen, X., Zhang, X., and Zhou, Y. (2021), “Fairness-aware Online Price Discrimination with Nonparametric Demand Models,” arXiv preprint arXiv:2111.08221.
  12. Chen, Y. and Farias, V. F. (2018), “Robust Dynamic Pricing with Strategic Customers,” Mathematics of Operations Research, 43, 1119–1142.
  13. Chen, Y., Liu, Y., and Podimata, C. (2020), “Learning Strategy-Aware Linear Classifiers,” in Advances in Neural Information Processing Systems, eds. Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., and Lin, H., Curran Associates, Inc., vol. 33, pp. 15265–15276.
  14. Cohen, M. C., Lobel, I., and Paes Leme, R. (2020), “Feature-Based Dynamic Pricing,” Management Science, 66, 4921–4943.
  15. Dong, J., Roth, A., Schutzman, Z., Waggoner, B., and Wu, Z. S. (2018), “Strategic Classification from Revealed Preferences,” in Proceedings of the 2018 ACM Conference on Economics and Computation, New York, NY, USA: Association for Computing Machinery, p. 55–70.
  16. Fan, J., Guo, Y., and Yu, M. (2022), “Policy Optimization Using Semiparametric Models for Dynamic Pricing,” Journal of the American Statistical Association, in press.
  17. Fang, E. X., Wang, Z., and Wang, L. (2022), “Fairness-Oriented Learning for Optimal Individualized Treatment Rules,” Journal of the American Statistical Association, in press.
  18. Ghalme, G., Nair, V., Eilat, I., Talgam-Cohen, I., and Rosenfeld, N. (2021), “Strategic Classification in the Dark,” in Proceedings of the 38th International Conference on Machine Learning, eds. Meila, M. and Zhang, T., PMLR, vol. 139 of Proceedings of Machine Learning Research, pp. 3672–3681.
  19. Golrezaei, N., Jaillet, P., and Cheuk Nam Liang, J. (2023), “Incentive-aware Contextual Pricing with Non-parametric Market Noise,” in Proceedings of The 26th International Conference on Artificial Intelligence and Statistics, eds. Ruiz, F., Dy, J., and van de Meent, J.-W., PMLR, vol. 206 of Proceedings of Machine Learning Research, pp. 9331–9361.
  20. Golrezaei, N., Javanmard, A., and Mirrokni, V. (2019), “Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions,” in Advances in Neural Information Processing Systems, vol. 32.
  21. Hambly, B., Xu, R., and Yang, H. (2023), “Recent advances in reinforcement learning in finance,” Mathematical Finance, 33, 437–503.
  22. Hannak, A., Soeller, G., Lazer, D., Mislove, A., and Wilson, C. (2014), “Measuring Price Discrimination and Steering on E-Commerce Web Sites,” in Proceedings of the 2014 Conference on Internet Measurement Conference, Association for Computing Machinery, p. 305–318.
  23. Hao, B., Lattimore, T., and Wang, M. (2020), “High-Dimensional Sparse Linear Bandits,” in Advances in Neural Information Processing Systems, eds. Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., and Lin, H., Curran Associates, Inc., vol. 33, pp. 10753–10763.
  24. Hardt, M., Megiddo, N., Papadimitriou, C., and Wootters, M. (2016), “Strategic Classification,” in Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, p. 111–122.
  25. Javanmard, A. and Nazerzadeh, H. (2019), “Dynamic Pricing in High-dimensions,” Journal of Machine Learning Research, 20, 1–49.
  26. Koren, T. and Levy, K. (2015), “Fast Rates for Exp-concave Empirical Risk Minimization,” in Advances in Neural Information Processing Systems, eds. Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., and Garnett, R., Curran Associates, Inc., vol. 28.
  27. Li, G., Chi, Y., Wei, Y., and Chen, Y. (2022), “Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model,” in Advances in Neural Information Processing Systems, eds. Koyejo, S., Mohamed, S., Agarwal, A., Belgrave, D., Cho, K., and Oh, A., Curran Associates, Inc., vol. 35, pp. 15353–15367.
  28. Li, X. and Li, K. J. (2023), “Beating the Algorithm: Consumer Manipulation, Personalized Pricing, and Big Data Management,” Manufacturing &\&& Service Operations Management, 25, 36–49.
  29. Luo, Y., Sun, W. W., and Liu, Y. (2023), “Distribution-Free Contextual Dynamic Pricing,” Mathematics of Operations Research, in press.
  30. Mikians, J., Gyarmati, L., Erramilli, V., and Laoutaris, N. (2013), “Crowd-Assisted Search for Price Discrimination in e-Commerce: First Results,” in Proceedings of the Ninth ACM Conference on Emerging Networking Experiments and Technologies, Association for Computing Machinery, p. 1–6.
  31. Miller, J., Milli, S., and Hardt, M. (2020), “Strategic Classification is Causal Modeling in Disguise,” in Proceedings of the 37th International Conference on Machine Learning, eds. III, H. D. and Singh, A., vol. 119 of Proceedings of Machine Learning Research, pp. 6917–6926.
  32. Phillips, R., Şimşek, A. S., and van Ryzin, G. (2015), “The Effectiveness of Field Price Discretion: Empirical Evidence from Auto Lending,” Management Science, 61, 1741–1759.
  33. Qi, Z., Miao, R., and Zhang, X. (2023), “Proximal learning for individualized treatment regimes under unmeasured confounding,” Journal of the American Statistical Association, 1–14.
  34. Qi, Z., Tang, J., Fang, E., and Shi, C. (2022), “Offline Feature-Based Pricing under Censored Demand: A Causal Inference Approach,” Available at SSRN 4040305.
  35. Shao, H., Blum, A., and Montasser, O. (2023), “Strategic Classification under Unknown Personalized Manipulation,” arXiv preprint arXiv:2305.16501.
  36. Shi, C., Song, R., Lu, W., and Li, R. (2021), “Statistical Inference for High-Dimensional Models via Recursive Online-Score Estimation,” Journal of the American Statistical Association, 116, 1307–1318.
  37. Shi, C., Zhu, J., Ye, S., Luo, S., Zhu, H., and Song, R. (2022), “Off-Policy Confidence Interval Estimation with Confounded Markov Decision Process,” Journal of the American Statistical Association, in press.
  38. Wang, C.-H., Wang, Z., Sun, W. W., and Cheng, G. (2022), “Online Regularization towards Always-Valid High-Dimensional Dynamic Pricing,” arXiv preprint arXiv:2007.02470.
  39. Xu, J. and Wang, Y.-X. (2021), “Logarithmic Regret in Feature-based Dynamic Pricing,” in Advances in Neural Information Processing Systems, vol. 34, pp. 13898–13910.
  40. Xu, J. and Wang, Y.-X. (2022), “Towards Agnostic Feature-based Dynamic Pricing: Linear Policies vs Linear Valuation with Unknown Noise,” in Proceedings of The 25th International Conference on Artificial Intelligence and Statistics, eds. Camps-Valls, G., Ruiz, F. J. R., and Valera, I., PMLR, vol. 151 of Proceedings of Machine Learning Research, pp. 9643–9662.
  41. Zhao, Z., Jiang, F., Yu, Y., and Chen, X. (2023), “High-Dimensional Dynamic Pricing under Non-Stationarity: Learning and Earning with Change-Point Detection,” arXiv preprint arXiv:2303.07570.
  42. Zhu, R., Zeng, D., and Kosorok, M. R. (2015), “Reinforcement learning trees,” Journal of the American Statistical Association, 110, 1770–1784.
Citations (4)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now