Inventory Control Involving Unknown Demand of Discrete Nonperishable Items - Analysis of a Newsvendor-based Policy

10/22/2015
by   Michael N. Katehakis, et al.
0

Inventory control with unknown demand distribution is considered, with emphasis placed on the case involving discrete nonperishable items. We focus on an adaptive policy which in every period uses, as much as possible, the optimal newsvendor ordering quantity for the empirical distribution learned up to that period. The policy is assessed using the regret criterion, which measures the price paid for ambiguity on demand distribution over T periods. When there are guarantees on the latter's separation from the critical newsvendor parameter β=b/(h+b), a constant upper bound on regret can be found. Without any prior information on the demand distribution, we show that the regret does not grow faster than the rate T^1/2+ϵ for any ϵ>0. In view of a known lower bound, this is almost the best one could hope for. Simulation studies involving this along with other policies are also conducted.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2018

Dynamic Pricing with Finitely Many Unknown Valuations

Motivated by posted price auctions where buyers are grouped in an unknow...
research
11/08/2019

Incentive-aware Contextual Pricing with Non-parametric Market Noise

We consider a dynamic pricing problem for repeated contextual second-pri...
research
12/25/2021

On Dynamic Pricing with Covariates

We consider the dynamic pricing problem with covariates under a generali...
research
10/19/2019

Online Pricing with Offline Data: Phase Transition and Inverse Square Law

This paper investigates the impact of pre-existing offline data on onlin...
research
11/21/2020

Self-adapting Robustness in Demand Learning

We study dynamic pricing over a finite number of periods in the presence...
research
07/10/2022

Learning to Order for Inventory Systems with Lost Sales and Uncertain Supplies

We consider a stochastic lost-sales inventory control system with a lead...
research
06/27/2018

Dynamic Assortment Selection under the Nested Logit Models

We study a stylized dynamic assortment planning problem during a selling...

Please sign up or login with your details

Forgot password? Click here to reset