需求信息非对称情况下零售商最优订货问题研究

考虑需求信息非对称环境下多个存在竞争的零售商的最优订货问题,每个零售商的需求分布函数未知,传统的通过最大化期望利润来求解最优订货量的方法此时不再适用,转而应用稳健优化中使用的方法-最小化最大后悔值方法.首先给出了零售商最优订货量的一般形式.其次考虑了问题的两种特殊情形:对称博弈、两个零售商的最优订货模型,得到:对称博弈存在Nash平衡点、竞争使得零售商订货量增大、信息不对称使得零售商订货量降低并且零售商的最优订货量在一定条件下会随回收残值的增大而增大;两个零售商最优订货模型下的最优订货量的具体形式.

The Retailers' Optimal Order Quantity Problem Research Under Asymmetric Demand Information

Under asymmetric demand information,we mainly analysis multiple retailers'optimal order problem between whom there exists competition,and each retailer's demand distribution is unknown,traditional expectation-based optimization criteria are not adequate and therefore we focus on the alternative criterion used in the robust optimization literature:the absolute regret minimization.First of all,we get the general form of the retailers' optimal order quantity,second,we consider two special cases:symmetric game and case with two retailers,then,we get:Nash equilibrium exists under symmetric game、competition increases retailers' Order quantity、asymmetric information decreases retailers' Order quantity and the optimal order quantity increases in residual value needs certain conditions;the specific form of optimal order quantity under two retailers' optimal order quantity model.