A knapsack approach to solving the capacitated newsvendor problem

Author(s):  
Pinyuan Shan ◽  
Layek Abdel Malek
Keyword(s):  
2016 ◽  
Vol 67 (2) ◽  
pp. 214-228 ◽  
Author(s):  
Lijun Ma ◽  
Weili Xue ◽  
Yingxue Zhao ◽  
Qinghua Zeng

2013 ◽  
Vol 231 (2) ◽  
pp. 328-336 ◽  
Author(s):  
Meng Wu ◽  
Stuart X. Zhu ◽  
Ruud H. Teunter

4OR ◽  
2012 ◽  
Vol 10 (3) ◽  
pp. 267-286 ◽  
Author(s):  
F. J. Arcelus ◽  
Satyendra Kumar ◽  
G. Srinivasan

2021 ◽  
Author(s):  
Saurabh Bansal ◽  
Mahesh Nagarajan

Replicating cash flows of multiple agents in game-theoretic settings tends to be a challenging task. In this paper, we consider the competitive newsvendor game where multiple newsvendors choose inventory levels before demand arrival and the unmet demand of each newsvendor spills over to multiple other newsvendors. We show that this spillover behavior and the resulting cash flows of each newsvendor can be replicated within a transportation problem after assigning artificial costs on spillover behavior. This replication provides an opportunity to study structural properties of the problem, as well as determine the equilibrium of the game. This paradigm of using artificial costs within an optimization framework to replicate agents’ cash flows can be used in many other games as well.


Sign in / Sign up

Export Citation Format

Share Document