Dynamic Realization Games in Newsvendor Inventory Centralization

Consider a set N of n (>1) stores with single-item and single-period nondeterministic demands like in a classic newsvendor setting with holding and penalty costs only. Assume a risk-pooling single-warehouse centralized inventory ordering option. Allocation of costs in the centralized inventory ordering corresponds to modelling it as a cooperative cost game whose players are the stores. It has been shown that when holding and penalty costs are identical for all subsets of stores, the game based on optimal expected costs has a non empty core (Hartman et. al., 2000, Muller \textit{et. al.}, 2002). In this paper we examine a related inventory centralization game based on demand realizations that has, in general, an empty core even with identical penalty and holding costs (Hartman and Dror, 2005). We propose a repeated cost allocation scheme for dynamic realization games based on allocation processes introduced by Lehrer (2002a). We prove that the cost subsequences of the dynamic realization game process, based on Lehrer's rules, converge almost surely to either a least square value or the core of the expected game. We extend the above results to more general dynamic cost games and relax the independence hypothesis of the sequence of players' demands at different stages

Dynamic realization games in newsvendor inventory centralization

Consider a set N of n (> 1) stores with single-item and single-period nondeterministic demands like in a classic newsvendor setting with holding and penalty costs only. Assume a risk-pooling single-warehouse centralized inventory ordering option. Allocation of costs in the centralized inventory ordering corresponds to modelling it as a cooperative cost game whose players are the stores. It has been shown that when holding and penalty costs are identical for all subsets of stores, the game based on optimal expected costs has a non empty core (Hartman et al. 2000, Games Econ Behav 31:26–49; Muller et al. 2002, Games Econ Behav 38:118–126). In this paper we examine a related inventory centralization game based on demand realizations that has, in general, an empty core even with identical penalty and holding costs (Hartman and Dror 2005, IIE Trans Scheduling Logistics 37:93–107). We propose a repeated cost allocation scheme for dynamic realization games based on allocation processes introduced by Lehrer (2002a, Int J Game Theor 31:341–351). We prove that the cost subsequences of the dynamic realization game process, based on Lehrer’s rules, converge almost surely to either a least square value or the core of the expected game. We extend the above results to more general dynamic cost games and relax the independence hypothesis of the sequence of players’ demands at different stages

Supply chain collaboration

In the past, research in operations management focused on single-firm analysis. Its goal was to provide managers in practice with suitable tools to improve the performance of their firm by calculating optimal inventory quantities, among others. Nowadays, business decisions are dominated by the globalization of markets and increased competition among firms. Further, more and more products reach the customer through supply chains that are composed of independent firms. Following these trends, research in operations management has shifted its focus from single-firm analysis to multi-firm analysis, in particular to improving the efficiency and performance of supply chains under decentralized control. The main characteristics of such chains are that the firms in the chain are independent actors who try to optimize their individual objectives, and that the decisions taken by a firm do also affect the performance of the other parties in the supply chain. These interactions among firms’ decisions ask for alignment and coordination of actions. Therefore, game theory, the study of situations of cooperation or conflict among heterogenous actors, is very well suited to deal with these interactions. This has been recognized by researchers in the field, since there are an ever increasing number of papers that applies tools, methods and models from game theory to supply chain problems

Stability and monotonicity in newsvendor situations

Cataloged from PDF version of article.This study considers a supply chain that consists of n retailers, each of them facing a newsvendor problem, and a supplier. Groups of retailers might increase their expected joint profit by joint ordering and inventory centralization. However, we assume that the retailers impose some level of stock that should be dedicated to them. In this situation, we show that the associated cooperative game has a non-empty core. Afterwards, we concentrate on a dynamic situation, where several model cost parameters and the retailers’ dedicated stock levels can change. We investigate how the profit division might be affected by these changes. We focus on four monotonicity properties. We identify several classes of games with retailers, where some of the monotonicity properties hold. Moreover, we show that pairs of cooperative games associated with newsvendor situations do not necessarily satisfy these properties in general, when changes in dedicated stock levels are in concern

A review of non-cooperative newsvendor games with horizontal inventory interactions

There are numerous applications of game theory in the analysis of supply chains where multiple actors interact with each other in order to reach their own objectives. In this paper we review the use of non-cooperative game theory in inventory management within the newsvendor framework describing a single period inventory control model with the focus on horizontal interactions among multiple independent newsvendors. We develop a framework for identifying these types of horizontal interactions including, for example, the models with the possibility of inventory sharing via transshipments, and situations with substitutable products sold by multiple newsvendors. Based on this framework, we discuss and relate the results of prior research and identify future research opportunities

Profit division in newsvendor situations with delivery restrictions

This study considers a supply chain that consists of n retailers, each of them facing a newsvendor problem, and a supplier. Groups of retailers might increase their expected joint profit by joint ordering and inventory centralization, which means that they give a joint order and allocate this quantity among themselves to maximize the total profit after the demands are realized. Furthermore, we assume that the retailers pose some restrictions on the number of items that should be delivered to them. In this situation, we show that the associated cooperative game has a non-empty core. Afterwards, we concentrate on a dynamic situation, where the retailers change their delivery restrictions. We investigate how the profit division might be affected by these changes. We define four new monotonicity properties, which we think are interesting in general, and we derive necessary and sufficient conditions for pairs of totally balanced TU-games to satisfy these properties. We also show that pairs of cooperative games associated with newsvendor situations do not necessarily satisfy these properties in general. Finally, we define a class of games with retailers having a normally distributed demand where one of the monotonicity properties holds

Robust newsvendor games with ambiguity in demand distributions

In classical newsvendor games, vendors collaborate to serve their aggregate demand whose joint distribution is assumed known with certainty. We investigate a new class of newsvendor games with ambiguity in the joint demand distributions, which is represented by a Fréchet class of distributions with some, possibly overlapping, marginal information. To model this new class of games, we use ideas from distributionally robust optimization to handle distributional ambiguity and study the robust newsvendor games. We provide conditions for the existence of core solutions of these games using the structural analysis of the worst-case joint demand distributions of the corresponding distributionally robust newsvendor optimization problem

Spare parts inventory pooling: how to share the benefits?

We consider a stock point for expensive, low-usage items that is operated by multiple decision makers. Each faces a Poisson demand process, and the joint stock point is controlled by a continuous-review base stock policy with full backordering. We consider penalty costs for backorders and holding costs for stock on hand. For this model, we derive structural properties of the resulting cost function. We use these to prove not only that it is cost e�ective to share one stock point with all parties involved, but also that collaboration (inventory pooling) can be supported by a stable cost allocation, i.e., the core of the associated cooperative game is non-empty. These results hold under optimized and under exogenously given base stock levels. For the former case, we further identify a stable cost allocation that would be easy to implement in practice and that induces players to reveal their private information truthfully