{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T02:00:45Z","timestamp":1777428045033,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T00:00:00Z","timestamp":1581379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T00:00:00Z","timestamp":1581379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000739","name":"University of Southampton","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000739","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2020,8]]},"abstract":"Abstract<\/jats:title>We study a pricing problem with finite inventory and semi-parametric demand uncertainty. Demand is a price-dependent Poisson process whose mean is the product of buyers\u2019 arrival rate, which is a constant $$\\lambda $$<\/jats:tex-math>\n\u03bb<\/mml:mi>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and buyers\u2019 purchase probability $$q(p)$$<\/jats:tex-math>\n\nq<\/mml:mi>\n(<\/mml:mo>\np<\/mml:mi>\n)<\/mml:mo>\n<\/mml:mrow>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula>, where p<\/jats:italic> is the price. The seller observes arrivals and sales, and knows neither $$\\lambda $$<\/jats:tex-math>\n\u03bb<\/mml:mi>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula> nor $$q$$<\/jats:tex-math>\nq<\/mml:mi>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Based on a non-parametric maximum-likelihood estimator of $$(\\lambda ,q)$$<\/jats:tex-math>\n\n(<\/mml:mo>\n\u03bb<\/mml:mi>\n,<\/mml:mo>\nq<\/mml:mi>\n)<\/mml:mo>\n<\/mml:mrow>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula>, we construct an estimator of mean demand and show that as the system size and number of prices grow, it is asymptotically more efficient than the maximum likelihood estimator based only on sale data. Based on this estimator, we develop a pricing algorithm paralleling (Besbes and Zeevi in Oper Res 57:1407\u20131420, 2009) and study its performance in an asymptotic regime similar to theirs: the initial inventory and the arrival rate grow proportionally to a scale parameter n<\/jats:italic>. If $$q$$<\/jats:tex-math>\nq<\/mml:mi>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula> and its inverse function are Lipschitz continuous, then the worst-case regret is shown to be $$O((\\log n \/ n)^{1\/4})$$<\/jats:tex-math>\n\nO<\/mml:mi>\n(<\/mml:mo>\n\n\n(<\/mml:mo>\nlog<\/mml:mo>\nn<\/mml:mi>\n\/<\/mml:mo>\nn<\/mml:mi>\n)<\/mml:mo>\n<\/mml:mrow>\n\n1<\/mml:mn>\n\/<\/mml:mo>\n4<\/mml:mn>\n<\/mml:mrow>\n<\/mml:msup>\n)<\/mml:mo>\n<\/mml:mrow>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula>. A second model considered is the one in Besbes and Zeevi (2009, Section 4.2), where no arrivals are involved; we modify their algorithm and improve the worst-case regret to $$O((\\log n \/ n)^{1\/4})$$<\/jats:tex-math>\n\nO<\/mml:mi>\n(<\/mml:mo>\n\n\n(<\/mml:mo>\nlog<\/mml:mo>\nn<\/mml:mi>\n\/<\/mml:mo>\nn<\/mml:mi>\n)<\/mml:mo>\n<\/mml:mrow>\n\n1<\/mml:mn>\n\/<\/mml:mo>\n4<\/mml:mn>\n<\/mml:mrow>\n<\/mml:msup>\n)<\/mml:mo>\n<\/mml:mrow>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula>. In each setting, the regret order is the best known, and is obtained by refining their proof methods. We also prove an $$\\Omega (n^{-1\/2})$$<\/jats:tex-math>\n\n\u03a9<\/mml:mi>\n(<\/mml:mo>\n\nn<\/mml:mi>\n\n-<\/mml:mo>\n1<\/mml:mn>\n\/<\/mml:mo>\n2<\/mml:mn>\n<\/mml:mrow>\n<\/mml:msup>\n)<\/mml:mo>\n<\/mml:mrow>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula> lower bound on the regret. Numerical comparisons to state-of-the-art alternatives<\/jats:italic> indicate the effectiveness of our arrivals-based approach.<\/jats:p>","DOI":"10.1007\/s00186-020-00704-y","type":"journal-article","created":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T15:02:46Z","timestamp":1581433366000},"page":"77-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A pricing problem with unknown arrival rate and price sensitivity"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9310-8894","authenticated-orcid":false,"given":"Athanassios N.","family":"Avramidis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,11]]},"reference":[{"key":"704_CR1","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1287\/opre.1090.0725","volume":"57","author":"VF Araman","year":"2009","unstructured":"Araman VF, Caldentey R (2009) Dynamic pricing for nonperishable products with demand learning. Oper Res 57:1169\u20131188","journal-title":"Oper Res"},{"key":"704_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Mach Learn 47:235\u2013256","journal-title":"Mach Learn"},{"issue":"1","key":"704_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2559152","volume":"3","author":"M Babaioff","year":"2015","unstructured":"Babaioff M, Dughmi S, Kleinberg R, Slivkins A (2015) Dynamic pricing with limited supply. ACM Trans Econ Comput 3(1):1\u201326","journal-title":"ACM Trans Econ Comput"},{"key":"704_CR4","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1287\/opre.1080.0640","volume":"57","author":"O Besbes","year":"2009","unstructured":"Besbes O, Zeevi A (2009) Dynamic pricing without knowing the demand function: risk bounds and near-optimal algorithms. Oper Res 57:1407\u20131420","journal-title":"Oper Res"},{"key":"704_CR5","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1287\/opre.1120.1103","volume":"60","author":"O Besbes","year":"2012","unstructured":"Besbes O, Zeevi A (2012) Blind network revenue management. Oper Res 60:1537\u20131550","journal-title":"Oper Res"},{"key":"704_CR6","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/mnsc.2014.2031","volume":"61","author":"O Besbes","year":"2015","unstructured":"Besbes O, Zeevi A (2015) On the (surprising) sufficiency of linear models for dynamic pricing with demand learning. Manag Sci 61:723\u2013739","journal-title":"Manag Sci"},{"key":"704_CR7","volume-title":"Mathematical statistics: basic ideas and selected topics","author":"PJ Bickel","year":"1977","unstructured":"Bickel PJ, Doksum KA (1977) Mathematical statistics: basic ideas and selected topics. Holden-Day Company, Oakland"},{"key":"704_CR8","volume-title":"Probability and measure","author":"P Billingsley","year":"1986","unstructured":"Billingsley P (1986) Probability and measure, 2nd edn. Wiley, New York","edition":"2"},{"key":"704_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1287\/msom.5.3.203.16031","volume":"5","author":"G Bitran","year":"2003","unstructured":"Bitran G, Caldentey R (2003) An overview of pricing models for revenue management. Manuf Serv Oper Manag 5:203\u2013229","journal-title":"Manuf Serv Oper Manag"},{"key":"704_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9477-8","volume-title":"Point processes and queues: martingale dynamics","author":"P Br\u00e9maud","year":"1981","unstructured":"Br\u00e9maud P (1981) Point processes and queues: martingale dynamics, vol 50. Springer, Berlin"},{"key":"704_CR11","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1287\/opre.1120.1057","volume":"60","author":"J Broder","year":"2012","unstructured":"Broder J, Rusmevichientong P (2012) Dynamic pricing under a general parametric choice model. Oper Res 60:965\u2013980","journal-title":"Oper Res"},{"key":"704_CR12","first-page":"1035","volume":"67","author":"B Chen","year":"2019","unstructured":"Chen B, Chao X, Ahn H-S (2019) Coordinating pricing and inventory replenishment with nonparametric demand learning. Oper Res 67:1035\u20131052","journal-title":"Oper Res"},{"key":"704_CR13","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1109\/TAC.2009.2019797","volume":"54","author":"E Cope","year":"2009","unstructured":"Cope E (2009) Regret and convergence bounds for a class of continuum-armed bandit problems. IEEE Trans Autom Control 54:1243\u20131253","journal-title":"IEEE Trans Autom Control"},{"key":"704_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5320-4","volume-title":"Large deviation techniques and applications","author":"A Dembo","year":"1998","unstructured":"Dembo A, Zeitouni O (1998) Large deviation techniques and applications. Springer, Berlin"},{"key":"704_CR15","first-page":"1","volume":"20","author":"AV den Boer","year":"2015","unstructured":"den Boer AV (2015) Dynamic pricing and learning: historical origins, current research, and new directions. Surv Oper Res Manag Sci 20:1\u201318","journal-title":"Surv Oper Res Manag Sci"},{"key":"704_CR16","unstructured":"den Boer AV, Keskin NB (2019) Discontinuous demand functions: estimation and pricing. Manag Sci. https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3003984"},{"key":"704_CR17","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1287\/mnsc.2013.1788","volume":"60","author":"AV den Boer","year":"2014","unstructured":"den Boer AV, Zwart B (2014) Simultaneously learning and optimizing using controlled variance pricing. Manag Sci 60:770\u2013783","journal-title":"Manag Sci"},{"key":"704_CR18","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1287\/opre.1090.0729","volume":"58","author":"VF Farias","year":"2010","unstructured":"Farias VF, Van Roy B (2010) Dynamic pricing with a prior on market response. Oper Res 58:16\u201329","journal-title":"Oper Res"},{"key":"704_CR19","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1287\/mnsc.40.8.999","volume":"40","author":"G Gallego","year":"1994","unstructured":"Gallego G, van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Manag Sci 40:999\u20131020","journal-title":"Manag Sci"},{"key":"704_CR20","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1287\/opre.2014.1294","volume":"62","author":"NB Keskin","year":"2014","unstructured":"Keskin NB, Zeevi A (2014) Dynamic pricing with an unknown demand model: asymptotically optimal semi-myopic policies. Oper Res 62:1142\u20131167","journal-title":"Oper Res"},{"key":"704_CR21","unstructured":"Kleinberg RD (2004) Nearly tight bounds for the continuum-armed bandit problem. In: Proceedings of the 17th international conference on neural information processing systems, pp 697\u2013704"},{"key":"704_CR22","doi-asserted-by":"crossref","unstructured":"Lei Y, Jasin S, Sinha A (2014) Near-optimal bisection search for nonparametric pricing with inventory constraint. https:\/\/deepblue.lib.umich.edu\/handle\/2027.42\/108717","DOI":"10.2139\/ssrn.2509425"},{"key":"704_CR23","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/j.ejor.2005.01.041","volume":"174","author":"KY Lin","year":"2006","unstructured":"Lin KY (2006) Dynamic pricing with real-time demand learning. Eur J Oper Res 174:522\u2013538","journal-title":"Eur J Oper Res"},{"key":"704_CR24","volume-title":"Principles of mathematical analysis","author":"W Rudin","year":"1976","unstructured":"Rudin W (1976) Principles of mathematical analysis, 3rd edn. McGraw-Hill, New York","edition":"3"},{"key":"704_CR25","volume-title":"Theory and practice of revenue management","author":"K Talluri","year":"2005","unstructured":"Talluri K, van Ryzin G (2005) Theory and practice of revenue management. Springer, Berlin"},{"key":"704_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/b13794","volume-title":"Introduction to nonparametric estimation","author":"AB Tsybakov","year":"2009","unstructured":"Tsybakov AB (2009) Introduction to nonparametric estimation. Springer, New York"},{"key":"704_CR27","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/opre.2013.1245","volume":"62","author":"Z Wang","year":"2014","unstructured":"Wang Z, Deng S, Ye Y (2014) Close the gaps: a learning-while-doing algorithm for a class of single-product revenue management problems. Oper Res 62:318\u2013331","journal-title":"Oper Res"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-020-00704-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-020-00704-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-020-00704-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T06:58:17Z","timestamp":1612940297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-020-00704-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,11]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["704"],"URL":"https:\/\/doi.org\/10.1007\/s00186-020-00704-y","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,11]]},"assertion":[{"value":"23 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}