Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning

Author:

Chen Boxiao1ORCID,Chao Xiuli2ORCID,Ahn Hyun-Soo3ORCID

Affiliation:

1. Department of Information and Decision Sciences, College of Business Administration, University of Illinois at Chicago, Chicago, Illinois 60607;

2. Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109;

3. Department of Technology and Operations, Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications

Reference37 articles.

1. Bandits with concave rewards and convex knapsacks

2. Agarwal A, Foster DP, Hsu DJ, Kakade SM, Rakhlin A (2011) Stochastic convex optimization with bandit feedback. Shawe-Taylor J, Zemel RS, Bartlett PL, Pereira FCN, Weinberger KQ, eds. Advances in Neural Information Processing Systems (NIPS) (Curran Associates Inc., Red Hook, NY), 1035–1043.

3. Improved Rates for the Stochastic Continuum-Armed Bandit Problem

4. Bandits with Knapsacks

5. On Implications of Demand Censoring in the Newsvendor Problem

Cited by 62 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3