{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T03:23:56Z","timestamp":1785209036194,"version":"3.55.0"},"reference-count":58,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Management Science"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:p>This paper introduces a novel contextual bandit algorithm for personalized pricing under utility fairness constraints in scenarios with uncertain demand, achieving an optimal regret upper bound. Our approach, which incorporates dynamic pricing and demand learning, addresses the critical challenge of fairness in pricing strategies. We first delve into the static full-information setting to formulate an optimal pricing policy as a constrained optimization problem. Here, we propose an approximation algorithm for efficiently and approximately computing the ideal policy. We also use mathematical analysis and computational studies to characterize the structures of optimal contextual pricing policies subject to fairness constraints, deriving simplified policies that lay the foundations of more in-depth research and extensions. Further, we extend our study to dynamic pricing problems with demand learning, establishing a nonstandard regret lower bound that highlights the complexity added by fairness constraints. Our research offers a comprehensive analysis of the cost of fairness and its impact on the balance between utility and revenue maximization. This work represents a step toward integrating ethical considerations into algorithmic efficiency in data-driven dynamic pricing.<\/jats:p>\n                  <jats:p>This paper was accepted by J. George Shanthikumar, big data analytics.<\/jats:p>\n                  <jats:p>Funding: X. Chen acknowledges support from the National Science Foundation [Grant IIS-1845444]. D. Simchi-Levi thanks the MIT Data Science Lab for support.<\/jats:p>\n                  <jats:p>Supplemental Material: The online appendix and data files are available at https:\/\/doi.org\/10.1287\/mnsc.2023.03956 .<\/jats:p>","DOI":"10.1287\/mnsc.2023.03956","type":"journal-article","created":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T13:58:14Z","timestamp":1754315894000},"page":"2619-2633","source":"Crossref","is-referenced-by-count":7,"title":["Utility Fairness in Contextual Dynamic Pricing with Demand Learning"],"prefix":"10.1287","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9049-9452","authenticated-orcid":false,"given":"Xi","family":"Chen","sequence":"first","affiliation":[{"name":"Leonard N. Stern School of Business, New York University, New York, New York 10012"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Simchi-Levi","sequence":"additional","affiliation":[{"name":"Institute for Data, Systems and Society, Operations Research Center, Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9410-0392","authenticated-orcid":false,"given":"Yining","family":"Wang","sequence":"additional","affiliation":[{"name":"Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas 75080"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"109","reference":[{"key":"B1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0725"},{"key":"B2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0701"},{"key":"B3","unstructured":"Balseiro SR, Lu H, Mirrokni V (2021) Regularized online allocation problems: Fairness and beyond.\n                      Proc. Internat. Conf. Machine Learn\n                      . (ICLR, Appleton, WI)."},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3680"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.4071"},{"key":"B6","doi-asserted-by":"crossref","unstructured":"Bateni MH, Chen Y, Ciocan DF, Mirrokni V (2016) Fair resource allocation in a volatile marketplace.\n                      Proc. ACM Conf. Econom. Comput\n                      . (ACM, New York).","DOI":"10.2139\/ssrn.2789380"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0640"},{"key":"B8","doi-asserted-by":"publisher","DOI":"10.1287\/msom.5.3.203.16031"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1057"},{"issue":"5","key":"B10","volume":"12","author":"Bubeck S","year":"2011","journal-title":"J. Machine Learn. Res."},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2016"},{"key":"B12","doi-asserted-by":"crossref","unstructured":"Chen Y, Wang H (2018) Why are fairness concerns so important? Lessons from a shared last-mile transportation system. Preprint, submitted April 30, https:\/\/dx.doi.org\/10.2139\/ssrn.3168324.","DOI":"10.2139\/ssrn.3168324"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2280"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.1993"},{"key":"B15","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2015.2238"},{"key":"B16","unstructured":"Chen G, Li X, Ye Y (2022a) Fairer LP-based online allocation via analytic center. Preprint, submitted October 27, https:\/\/arxiv.org\/abs\/2110.14621v4."},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2347"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.4129"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2023.4859"},{"key":"B20","doi-asserted-by":"crossref","unstructured":"Chen E, Chen X, Gao L, Li J (2024a) Dynamic contextual pricing with doubly non-parametric random utility models. Preprint, submitted May 11, https:\/\/arxiv.org\/abs\/2405.06866.","DOI":"10.2139\/ssrn.4824569"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1111\/poms.13741"},{"key":"B22","doi-asserted-by":"crossref","unstructured":"Chen J, Li Z, Qi A, Wang Y (2023c) Capacity and pricing management with demand learning. Preprint, submitted April 19, https:\/\/dx.doi.org\/10.2139\/ssrn.4414361.","DOI":"10.2139\/ssrn.4414361"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1177\/10591478231225176"},{"key":"B24","doi-asserted-by":"crossref","unstructured":"Chen X, Lyu J, Zhang X, Zhou Y (2021) Fairness-aware online price discrimination with nonparametric demand models. Preprint, submitted November 16, https:\/\/arxiv.org\/abs\/2111.08221.","DOI":"10.2139\/ssrn.3953575"},{"key":"B25","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3772"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2022.4317"},{"key":"B27","doi-asserted-by":"crossref","unstructured":"Cohen MC, Miao S, Wang Y (2021) Dynamic pricing with fairness constraints. Preprint, submitted September 28, https:\/\/doi.org\/10.2139\/ssrn.3930622.","DOI":"10.2139\/ssrn.3930622"},{"key":"B28","doi-asserted-by":"publisher","DOI":"10.1016\/j.sorms.2015.03.001"},{"key":"B29","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2013.1788"},{"key":"B30","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.49.10.1287.17315"},{"key":"B31","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2022.2128359"},{"key":"B32","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0729"},{"key":"B33","unstructured":"FCA (2018) Fair pricing in financial services. Accessed January, 2019, https:\/\/www.fca.org.uk\/publication\/discussion\/dp18-09.pdf."},{"key":"B34","doi-asserted-by":"crossref","unstructured":"Feng Q, Zhu R, Jasin S (2023) Temporal fairness in learning and earning: Price protection guarantee and phase transitions.\n                      Proc. ACM Conf. Econom. Comput.\n                      (ACM, New York).","DOI":"10.2139\/ssrn.4265182"},{"key":"B35","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.40.8.999"},{"key":"B36","doi-asserted-by":"crossref","unstructured":"Gupta S, Kamble V (2019) Individual fairness in hindsight.\n                      Proc. ACM Conf. Econom. Comput\n                      . (ACM, New York).","DOI":"10.1145\/3328526.3329605"},{"key":"B37","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2215"},{"key":"B38","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1110.1426"},{"key":"B39","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2237"},{"issue":"9","key":"B40","first-page":"1","volume":"20","author":"Javanmard A","year":"2019","journal-title":"J. Machine Learn. Res."},{"key":"B41","doi-asserted-by":"crossref","unstructured":"Jia S, Li A, Ravi R (2021) Markdown pricing under unknown demand. Preprint, submitted June 8, https:\/\/doi.org\/10.2139\/ssrn.3861379.","DOI":"10.2139\/ssrn.3861379"},{"key":"B42","doi-asserted-by":"crossref","unstructured":"Kallus N, Zhou A (2021) Fairness, welfare, and equity in personalized pricing.\n                      Proc. ACM Conf. Fairness Accountability Transparency\n                      (ACM, New York).","DOI":"10.1145\/3442188.3445895"},{"key":"B43","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2014.1294"},{"key":"B44","doi-asserted-by":"crossref","unstructured":"Lei YM, Jasin S, Sinha A (2014) Near-optimal bisection search for nonparametric dynamic pricing with inventory constraint. Preprint, submitted October 15, https:\/\/doi.org\/10.2139\/ssrn.2509425.","DOI":"10.2139\/ssrn.2509425"},{"key":"B45","doi-asserted-by":"publisher","DOI":"10.1287\/msom.1110.0344"},{"key":"B46","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2015.2265"},{"key":"B47","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1722"},{"key":"B48","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2023.1369"},{"key":"B49","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2023.4700"},{"key":"B50","doi-asserted-by":"publisher","DOI":"10.1111\/poms.13783"},{"key":"B51","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0446"},{"key":"B52","doi-asserted-by":"crossref","unstructured":"Simchi-Levi D, Xu Y (2019) Phase transitions and cyclic phenomena in bandits with switching constraints.\n                      Advances in Neural Information Processing Systems (NeurIPS)\n                      (MIT Press, Cambridge, MA).","DOI":"10.2139\/ssrn.3380783"},{"key":"B53","unstructured":"Smith A (2020) Using artificial intelligence and algorithms. Accessed January 2019, https:\/\/www.ftc.gov\/business-guidance\/blog\/2020\/04\/using-artificial-intelligence-and-algorithms."},{"key":"B54","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3819"},{"key":"B55","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2013.1245"},{"key":"B56","doi-asserted-by":"publisher","DOI":"10.1111\/poms.13337"},{"key":"B57","author":"Wang C-H","year":"2023","journal-title":"J. Amer. Statist. Assoc. (Theory Methods)."},{"key":"B58","unstructured":"Xu J, Qiao D, Wang Y-X (2023) Doubly fair dynamic pricing.\n                      Proc. 26th Internat. Conf. Artificial Intelligence Statist\n                      . (PMLR, New York)."}],"container-title":["Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/mnsc.2023.03956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:34:12Z","timestamp":1772789652000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/mnsc.2023.03956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10.1287\/mnsc.2023.03956"],"URL":"https:\/\/doi.org\/10.1287\/mnsc.2023.03956","relation":{},"ISSN":["0025-1909","1526-5501"],"issn-type":[{"value":"0025-1909","type":"print"},{"value":"1526-5501","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}