{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T06:34:52Z","timestamp":1778567692703,"version":"3.51.4"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032085597","type":"print"},{"value":"9783032085603","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-08560-3_27","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:23:16Z","timestamp":1767320596000},"page":"476-493","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["LP-Based Control for\u00a0Network Revenue Management Under Markovian Demands"],"prefix":"10.1007","author":[{"given":"Haixiang","family":"Lan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"Gallego","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zizhuo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"27_CR1","unstructured":"Agrawal, S., Avadhanula, V., Goyal, V., Zeevi, A.: Thompson sampling for the MNL-bandit. In: Conference on Learning Theory, pp. 76\u201378. PMLR (2017)"},{"issue":"5","key":"27_CR2","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1287\/opre.2018.1832","volume":"67","author":"S Agrawal","year":"2019","unstructured":"Agrawal, S., Avadhanula, V., Goyal, V., Zeevi, A.: MNL-bandit: a dynamic learning approach to assortment selection. Oper. Res. 67(5), 1453\u20131485 (2019)","journal-title":"Oper. Res."},{"issue":"4","key":"27_CR3","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1287\/opre.2014.1289","volume":"62","author":"S Agrawal","year":"2014","unstructured":"Agrawal, S., Wang, Z., Ye, Y.: A dynamic near-optimal algorithm for online linear programming. Oper. Res. 62(4), 876\u2013890 (2014)","journal-title":"Oper. Res."},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Aouad, A., Ma, W.: A nonparametric framework for online stochastic matching with correlated arrivals. In: Proceedings of the 24th ACM Conference on Economics and Computation, EC 2023, p.\u00a0114. Association for Computing Machinery, New York (2023)","DOI":"10.1145\/3580507.3597773"},{"issue":"7","key":"27_CR5","doi-asserted-by":"publisher","first-page":"4016","DOI":"10.1287\/mnsc.2023.4769","volume":"69","author":"Y Bai","year":"2023","unstructured":"Bai, Y., El Housni, O., Jin, B., Rusmevichientong, P., Topaloglu, H., Williamson, D.P.: Fluid approximations for revenue management under high-variance demand. Manage. Sci. 69(7), 4016\u20134026 (2023)","journal-title":"Manage. Sci."},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Freund, D.: Uniform loss algorithms for online stochastic decision-making with applications to bin packing. In: Abstracts of the 2020 SIGMETRICS\/Performance Joint International Conference on Measurement and Modeling of Computer Systems, pp.\u00a01\u20132 (2020)","DOI":"10.1145\/3393691.3394224"},{"issue":"4","key":"27_CR7","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1287\/opre.2016.1505","volume":"64","author":"J Blanchet","year":"2016","unstructured":"Blanchet, J., Gallego, G., Goyal, V.: A Markov chain approximation to choice modeling. Oper. Res. 64(4), 886\u2013905 (2016)","journal-title":"Oper. Res."},{"issue":"8","key":"27_CR8","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1002\/nav.21737","volume":"65","author":"A den Boer","year":"2018","unstructured":"den Boer, A., Perry, O., Zwart, B.: Dynamic pricing policies for an inventory model with random windows of opportunities. Nav. Res. Logist. 65(8), 660\u2013675 (2018)","journal-title":"Nav. Res. Logist."},{"issue":"7","key":"27_CR9","doi-asserted-by":"publisher","first-page":"2993","DOI":"10.1287\/mnsc.2019.3365","volume":"66","author":"P Bumpensanti","year":"2020","unstructured":"Bumpensanti, P., Wang, H.: A re-solving heuristic with uniformly bounded loss for network revenue management. Manage. Sci. 66(7), 2993\u20133009 (2020)","journal-title":"Manage. Sci."},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1287\/opre.2022.2358","volume":"72","author":"G Chen","year":"2024","unstructured":"Chen, G., Li, X., Ye, Y.: An improved analysis of LP-based control for revenue management. Oper. Res. 72(3), 1124\u20131138 (2024)","journal-title":"Oper. Res."},{"issue":"5","key":"27_CR11","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/j.orl.2018.08.006","volume":"46","author":"X Chen","year":"2018","unstructured":"Chen, X., Wang, Y.: A note on a tight lower bound for capacitated MNL-bandit assortment selection models. Oper. Res. Lett. 46(5), 534\u2013537 (2018)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"27_CR12","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1287\/moor.2021.1133","volume":"46","author":"X Chen","year":"2021","unstructured":"Chen, X., Wang, Y., Zhou, Y.: Optimal policy for dynamic assortment planning under multinomial logit models. Math. Oper. Res. 46(4), 1639\u20131657 (2021)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"27_CR13","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1287\/opre.2017.1628","volume":"65","author":"JB Feldman","year":"2017","unstructured":"Feldman, J.B., Topaloglu, H.: Revenue management under the Markov chain choice model. Oper. Res. 65(5), 1322\u20131342 (2017)","journal-title":"Oper. Res."},{"issue":"7","key":"27_CR14","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1287\/mnsc.46.7.941.12035","volume":"46","author":"Y Feng","year":"2000","unstructured":"Feng, Y., Gallego, G.: Perishable asset revenue management with Markovian time dependent demand intensities. Manage. Sci. 46(7), 941\u2013956 (2000)","journal-title":"Manage. Sci."},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Freund, D., Banerjee, S.: Good prophets know when the end is near. Manage. Sci. (2024)","DOI":"10.1287\/mnsc.2023.04307"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Freund, D., Zhao, J.: Overbooking with bounded loss. In: Proceedings of the 22nd ACM Conference on Economics and Computation, pp. 477\u2013478 (2021)","DOI":"10.1145\/3465456.3467577"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Gallego, G., Lu, W.: An optimal greedy heuristic with minimal learning regret for the Markov chain choice model. Available at SSRN 3810470 (2021)","DOI":"10.2139\/ssrn.3810470"},{"issue":"8","key":"27_CR18","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.: Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Manage. Sci. 40(8), 999\u20131020 (1994)","journal-title":"Manage. Sci."},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/opre.45.1.24","volume":"45","author":"G Gallego","year":"1997","unstructured":"Gallego, G., van Ryzin, G.: A multiproduct dynamic pricing problem and its applications to network yield management. Oper. Res. 45(1), 24\u201341 (1997)","journal-title":"Oper. Res."},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2019.11.014","volume":"808","author":"A Gupta","year":"2020","unstructured":"Gupta, A., Hsu, D.: Parameter identification in Markov chain choice models. Theoret. Comput. Sci. 808, 99\u2013107 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR21","unstructured":"Hsu, D.J., Kontorovich, A., Szepesv\u00e1ri, C.: Mixing time estimation in reversible Markov chains from a single sample path. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"issue":"4","key":"27_CR22","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1287\/opre.2015.1390","volume":"63","author":"S Jasin","year":"2015","unstructured":"Jasin, S.: Performance of an LP-based control for revenue management with unknown demand parameters. Oper. Res. 63(4), 909\u2013915 (2015)","journal-title":"Oper. Res."},{"issue":"2","key":"27_CR23","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1287\/moor.1120.0537","volume":"37","author":"S Jasin","year":"2012","unstructured":"Jasin, S., Kumar, S.: A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Math. Oper. Res. 37(2), 313\u2013345 (2012)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"27_CR24","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1287\/opre.2013.1216","volume":"61","author":"S Jasin","year":"2013","unstructured":"Jasin, S., Kumar, S.: Analysis of deterministic LP-based booking limit and bid price controls for revenue management. Oper. Res. 61(6), 1312\u20131320 (2013)","journal-title":"Oper. Res."},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Jia, J., et al.: Online resource allocation in Markov chains. In: Proceedings of the ACM Web Conference 2023, pp. 3498\u20133507 (2023)","DOI":"10.1145\/3543507.3583428"},{"key":"27_CR26","unstructured":"Jiang, J.: Constant approximation for network revenue management with Markovian-correlated customer arrivals. arXiv preprint arXiv:2305.05829 (2023)"},{"issue":"3","key":"27_CR27","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1287\/opre.2022.0316","volume":"72","author":"NB Keskin","year":"2024","unstructured":"Keskin, N.B., Li, M.: Selling quality-differentiated products in a Markovian market with unknown transition probabilities. Oper. Res. 72(3), 885\u2013902 (2024)","journal-title":"Oper. Res."},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Li, S., Luo, Q., Huang, Z., Shi, C.: Online learning for constrained assortment optimization under Markov chain choice model. Oper. Res. (2024)","DOI":"10.1287\/opre.2022.0693"},{"issue":"5","key":"27_CR29","doi-asserted-by":"publisher","first-page":"2948","DOI":"10.1287\/opre.2021.2164","volume":"70","author":"X Li","year":"2022","unstructured":"Li, X., Ye, Y.: Online linear programming: dual convergence, new algorithms, and regret bounds. Oper. Res. 70(5), 2948\u20132966 (2022)","journal-title":"Oper. Res."},{"issue":"6","key":"27_CR30","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0167-6377(89)90014-X","volume":"8","author":"N Megiddo","year":"1989","unstructured":"Megiddo, N., Chandrasekaran, R.: On the $$\\varepsilon $$-perturbation method for avoiding degeneracy. Oper. Res. Lett. 8(6), 305\u2013308 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"27_CR31","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.1070.0288","volume":"33","author":"MI Reiman","year":"2008","unstructured":"Reiman, M.I., Wang, Q.: An asymptotically optimal policy for a quantity-based network revenue management problem. Math. Oper. Res. 33(2), 257\u2013282 (2008)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"27_CR32","doi-asserted-by":"publisher","first-page":"1666","DOI":"10.1287\/opre.1100.0866","volume":"58","author":"P Rusmevichientong","year":"2010","unstructured":"Rusmevichientong, P., Shen, Z.J.M., Shmoys, D.B.: Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6), 1666\u20131680 (2010)","journal-title":"Oper. Res."},{"issue":"5\u20137","key":"27_CR33","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1016\/0165-1889(94)00827-5","volume":"19","author":"A Rustichini","year":"1995","unstructured":"Rustichini, A., Wolinsky, A.: Learning about variable demand in the long run. J. Econ. Dyn. Control 19(5\u20137), 1283\u20131292 (1995)","journal-title":"J. Econ. Dyn. Control"},{"issue":"3","key":"27_CR34","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/msom.2013.0429","volume":"15","author":"D Saur\u00e9","year":"2013","unstructured":"Saur\u00e9, D., Zeevi, A.: Optimal dynamic assortment planning with demand learning. Manuf. Serv. Oper. Manage. 15(3), 387\u2013404 (2013)","journal-title":"Manuf. Serv. Oper. Manage."},{"issue":"3","key":"27_CR35","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1287\/opre.2017.1692","volume":"66","author":"AS \u015eim\u015fek","year":"2018","unstructured":"\u015eim\u015fek, A.S., Topaloglu, H.: An expectation-maximization algorithm to estimate the parameters of the Markov chain choice model. Oper. Res. 66(3), 748\u2013760 (2018)","journal-title":"Oper. Res."},{"key":"27_CR36","doi-asserted-by":"crossref","unstructured":"Talluri, K., van Ryzin, G.: An analysis of bid-price controls for network revenue management. Manage. Sci. 44(11-part-1), 1577\u20131593 (1998)","DOI":"10.1287\/mnsc.44.11.1577"},{"issue":"3","key":"27_CR37","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.1287\/mnsc.2020.3624","volume":"67","author":"A Vera","year":"2021","unstructured":"Vera, A., Banerjee, S.: The Bayesian prophet: a low-regret framework for online decision making. Manage. Sci. 67(3), 1368\u20131391 (2021)","journal-title":"Manage. Sci."},{"issue":"3","key":"27_CR38","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/opre.1050.0194","volume":"53","author":"D Zhang","year":"2005","unstructured":"Zhang, D., Cooper, W.L.: Revenue management for parallel flights with customer-choice behavior. Oper. Res. 53(3), 415\u2013431 (2005)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08560-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:23:18Z","timestamp":1767320598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08560-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032085597","9783032085603"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08560-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edinburgh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}