Abstract
In the paper, we study the inventory centralization problem with risk-averse newsvendors using cooperative game theory. Pareto-optimality and collective rationality conditions are adopted to characterize the stable profit allocations among coalition members. Pareto-optimal profit allocation rules are derived for exponential and power utilities while the necessary and sufficient conditions are shown for stable profit allocations. We also show that the game model has a nonempty core when the exponential and power utilities are adopted to describe the risk-averse behavior.
Similar content being viewed by others
References
Agrawal, V., & Seshadri, S. (2000). Risk intermediation in supply chains. IIE Transactions, 32(9), 819–831.
Aust, G. (2015). Vertical cooperative advertising in supply chain management: A game-theoretic analysis. Cham, Switzerland: Springer.
Baron, D. P. (1973). Point estimation and risk preferences. Journal of the American Statistical Association, 68(344), 944–950.
Baton, B., & Lemaire, J. (1981). The core of a reinsurance market. Astin Bulletin, 12(1), 57–71.
Bernstein, D. S. (2005). Matrix mathematics: Theory, facts, and formulas with application to linear systems theory. Princeton: Princeton University Press.
Bondareva, O. N. (1963). Some applications of linear programming methods to the theory of cooperative games (in Russian). Problemy Kybernetiki, 10, 119–139.
Borch, K. (1960). The safety loading of reinsurance premiums. Scandinavian Actuarial Journal, 1960(3–4), 163–184.
Bouakiz, M., & Sobel, M. J. (1992). Inventory control with an exponential utility criterion. Operations Research, 40(3), 603–608.
Caron, F., & Marchet, G. (1996). The impact of inventory centralization/decentralization on safety stock for two-echelon systems. Journal of Business Logistics, 17(1), 233–257.
Chen, F., & Federgruen, A. (2000). Mean-variance analysis of basic inventory models. New York: Technical Manuscript Columbia University.
Chen, X. (2009). Inventory centralization games with price-dependent demand and quantity discount. Operations Research, 57(6), 1394–1406.
Chen, X., Gao, X., Hu, Z., & Wang, Q. (2016). Population monotonicity in newsvendor games. Working paper, University of Illinois at Urbana-Champaign.
Chen, X., Sim, M., Simchi-Levi, D., & Sun, P. (2007). Risk aversion in inventory management. Operations Research, 55(5), 828–842.
Chen, X., Shum, S., & Simchi-Levi, D. (2014). Stable and coordinating contracts for a supply chain with multiple risk-averse suppliers. Production and Operations Management, 23(3), 379–392.
Chen, X., & Zhang, J. (2009). A stochastic programming duality approach to inventory centralization games. Operations Research, 57(4), 840–851.
Chiu, C. H., & Chio, T. M. (2016). Supply chain risk analysis with mean-variance models: A technical review. Annals of Operations Research, 240(2), 489–507.
Choi, S., & Ruszczyński, A. (2011). A multi-product risk-averse newsvendor with exponential utility function. European Journal of Operational Research, 214(1), 78–84.
Eeckhoudt, L., Gollier, C., & Schlesinger, H. (1995). The risk-averse (and prudent) newsboy. Management Science, 41(5), 786–794.
Eppen, G. D. (1979). Note-effects of centralization on expected costs in a multi-location newsboy problem. Management Science, 25(5), 498–501.
Fang, X., & Cho, S. H. (2014). Stability and endogenous formation of inventory transhipment networks. Operations Research, 62(6), 1316–1334.
Gan, X., Sethi, S. P., & Yan, H. (2004). Coordination of supply chains with risk-averse agents. Production and Operations Management, 13(2), 135–149.
Gerber, H. U. (1974). On additive premium calculation principles. Astin Bulletin, 7(3), 215–222.
Gerber, H. U., & Pafum, G. (1998). Utility functions: From risk theory to finance. North American Actuarial Journal, 2(3), 74–91.
Gerchak, Y., & Gupta, D. (1991). On apportioning costs to customers in centralized continuous review inventory systems. Journal of Operations Management, 10(4), 546–551.
Goh, S. H., & Lim, B. L. (2014). Centralizing slow-moving items in a retail network - a case study. In Proceedings of the 2014 international conference on industrial engineering and operations management, Bali, Indonesia 2014: IEOM.
Gotoh, J., & Takano, Y. (2007). Newsvendor solutions via conditional value-at-risk minimization. European Journal of Operational Research, 179(1), 80–96.
Hartman, B. C., & Dror, M. (1996). Cost allocation in continuous-review inventory models. Naval Research Logistics, 43(4), 549–561.
Hartman, B. C., & Dror, M. (2003). Optimizing centralized inventory operations in a cooperative game theory setting. IIE Transactions, 35(3), 243–257.
Hartman, B. C., & Dror, M. (2005). Allocation of gains from inventory centralization in newsvendor environments. IIE Transactions, 37(2), 93–107.
Hiiemaa, K. (2016). In the success stories of H&M, Zara, Ikea and Walmart, luck is not a key factor. https://erply.com/in-the-success-stories-of-hm-zara-ikea-and-walmart-luck-is-not-a-key-factor/.
Horowitz, I. (1970). Decision making and the theory of the firm. NY: Holt, Rinehart and Winston.
Janakiraman, G., & Muckstadt, J. A. (2004). Inventory control in directed networks: A note on linear costs. Operations Research, 52(3), 491–495.
Kemahlioğlu-Ziya, E., & Bartholdi, J. J. (2011). Centralizing inventory in supply chains by using Shapley value to allocate the profits. Manufacturing & Service Operations Management, 13(2), 146–162.
Keren, B., & Pliskin, J. S. (2006). A benchmark solution for the risk-averse newsvendor problem. European Journal of Operational Research, 174(3), 1643–1650.
Lau, H. S. (1980). The newsboy problem under alternative optimization objectives. The Journal of the Operational Research Society, 31(6), 525–535.
Lemaire, J. (1973). Optimalité d’un contrat d’échange de risques entre assureurs. Cahiers du Center d’Etudes de Recherche Opérationnelle, 15, 139–156.
Mathew, J., John, J., & Kumar, S. (2013). New trends in healthcare supply chain. In , POMS 24th annual conference “integrating practice in POM research and teaching”, denver, USA 2013: POMS.
Meca, A., Timmer, J., García-Jurado, I., & Borm, P. (2004). Inventory games. European Journal of Operational Research, 156(1), 127–139.
Montrucchio, L., & Scarsini, M. (2007). Large newsvendor games. Games and Economic Behavior, 58(2), 316–337.
Müller, A., Scarsini, M., & Shaked, M. (2002). The newsvendor game has a nonempty core. Games and Economic Behavior, 38(1), 118–126.
Özen, U., Fransoo, J., Norde, H., & Slikker, M. (2008). Cooperation between multiple newsvendors with warehouses. Manufacturing & Service Operations Management, 10(2), 311–324.
Özen, U., Sošić, G., & Slikker, M. (2012). A collaborative decentralized distribution system with demand forecast updates. European Journal of Operational Research, 216(3), 573–583.
Pratt, J. W. (1964). Risk aversion in the small and in the large. Econometrica, 32(1/2), 122–136.
Raiffa, H. (1970). Decision Analysis. Reading,MA: Addison-Wesly.
Robinson, L. W. (1993). A comment on Gerchak and Gupta’s “on apportioning costs to customers in centralized continuous review inventory systems”. Journal of Operations Management, 11(1), 99–102.
Sagastizábal, C. A. (1995). A vindication of centralized controls in inventory management. Annals of Operations Research, 58(5), 361–378.
Sarno, D., Iannone, R., Lambiase, A., Miranda, S., & Riemma, S. (2014). Pulling drugs along the supply chain: Centralization of hospitals’ inventory. International Journal of Engineering Business Management, 6(21), 1–11.
Shapley, L. S. (1967). On balanced sets and cores. Naval Research Logistics Quarterly, 14(4), 453–460.
Slikker, M., Fransoo, J., & Wouters, M. (2005). Cooperation between multiple news-vendors with transshipments. European Journal of Operational Research, 167(2), 370–380.
Tallon, W. J. (1993). The impact of inventory centralization on aggregate safety stock: The variable supply lead time case. Journal of Business Logistics, 14(1), 185–203.
Toriello, A., & Uhan, N. A. (2016). Dynamic linear programming games with risk-averse players. Mathematical Programming, doi:10.1007/s10107-016-1054-y.
Wang, C. X., Webster, S., & Suresh, N. C. (2009). Would a risk-averse newsvendor order less at a higher selling price? European Journal of Operational Research, 196(2), 544–553.
Wilson, R. (1968). The theory of syndicates. Econometrica, 36(1), 119–132.
Wu, J., Li, J., Wang, S., & Cheng, T. (2009). Mean-variance analysis of the newsvendor model with stockout cost. Omega, 37(3), 724–730.
Zhao, H., Deshpande, V., & Ryan, J. K. (2005). Inventory sharing and rationing in decentralized dealer networks. Management Science, 51(4), 531–547.
Acknowledgements
Jiahua Zhang’s research was supported by Fudan University Student Growth Fund Scholarship. Shu-Cherng Fang’s research was supported by US ARO Grant # W911NF-15-1-0223. Yifan Xu’s research was supported by Chinese NSFC Grant # 71372113, 71531005 and The Join Fundation of Fudan-Taida. The authors would like to thank the editor and two anonymous reviewers whose most valuable comments and suggestions have significantly improved the quality of this work.
Author information
Authors and Affiliations
Corresponding author
Appendix: Proofs of theorems and lemmas
Appendix: Proofs of theorems and lemmas
Proof of Lemma1
Since
we have
Let \(\text {I}({q\le D_{S}})\) equal 1 if \(q\le D_{S}\) and 0 otherwise.
First, we see that
Then, we have
Since v is strictly increasing and strictly concave, we have \(v'(\cdot )> 0\) and \(v''(\cdot )< 0\) for \(q\ge 0\). Hence \(\frac{d^{2} E[v(\varPi (S, q))]}{d q^{2}}< 0\) for \(q\ge 0\), which means that \(E[v(\varPi (S, q))]\) is a strictly concave function of q. \(\square \)
Proof of Theorem 1
Suppose \((X_{i})_{i\in S}\) is a Pareto-optimal risk sharing scheme of S. Then there exists an order \(q\ge 0\) such that \(\sum _{i\in S} X_{i}=\varPi (S, q)\). From Sect. 3.1, there exist \(a_{i}>0\), \(i\in S\) with \(\sum _{i\in S} a_{i}=1\) such that \((X_{i})_{i\in S}\) is the solution of (4) and (5). From Raiffa (1970), for the exponential utilities (6), we have
From (6), when newsvendor \(i\in S\) has a profit \(X_{i}\), his maximum expected utility is reached at
Since
we have
In Lemma 1, let \(v(x)=(\sum _{j\in S}\frac{1}{\alpha _{j}})(1-\exp (-\frac{1}{\sum _{j\in S}1/\alpha _{j}}x))\), for \(x\in \mathbb {R}\). Then we see that \(E\big [(\sum _{j\in S}\frac{1}{\alpha _{j}})\big (1-\exp (-\frac{1}{\sum _{j\in S}1/\alpha _{j}}\varPi (S, q))\big )\big ]\) is a strictly concave function of \(q\ge 0\) and, consequently,
is unique.
Therefore, every newsvendor \(i\in S\) obtains his maximum expected utility at the same order \(q_{S}^{\star }\) given by (7). Since \((X_{i})_{i\in S}\) is a Pareto-optimal risk sharing scheme of coalition S, we have \(q=q_{S}^{\star }\) and
For each \(i\in S\), let \(z_{i}=-\frac{1/\alpha _{i}}{\sum _{j\in S}1/\alpha _{j}}\sum _{j\in S} \frac{1}{\alpha _{j}}\ln \frac{a_{i}}{a_{j}}\). Then
Hence \((X_{i})_{i\in S}\) is an element of (8).
Suppose \((X_{i})_{i\in S}\) is an element of (8), i.e., there exist \(z_{i}\in \mathbb {R}\), \(i\in S\) with \(\sum _{i\in S} z_{i}=0\) such that
From the matrix theory (Bernstein 2005), there exist \(a_{i}>0\), \(i\in S\) with \(\sum _{i\in S} a_{i}=1\) such that \(z_{i}=-\frac{1/\alpha _{i}}{\sum _{j\in S}1/\alpha _{j}}\sum _{j\in S} \frac{1}{\alpha _{j}}\ln \frac{a_{i}}{a_{j}}\), for each \(i\in S\). From Sect. 3.1, corresponding to \(a_{i}\), \(i\in S\), there is a Pareto-optimal risk sharing scheme \((X_{i}')_{i\in S}\), where
for \(i\in S\) and some \(q\ge 0\). It is not difficult to verify that \(q=q_{S}^{\star }\). Hence \(X_{i}=X_{i}'\), for \(i\in S\). Hence \((X_{i})_{i\in S}\) is a Pareto-optimal risk sharing scheme of S.
Consequently, the set of Pareto-optimal risk sharing schemes of S is given by (8). Moreover, we can see that the Pareto-optimal order of S is given by (7). \(\square \)
Proof of Lemma 2
For newsvendor \(i\in N\), let
where \(X_{i}\) is the profit of i. Note that for two possible profits of newsvendor i, say, \(X_{i}\) and \(X_{i}'\), we know \(T_{i}(X_{i})\ge T_{i}(X_{i}')\) if and only if \(U_{i}(X_{i})\ge U_{i}(X_{i}')\).
Let \((X_{i})_{i\in N}\) be a Pareto-optimal risk sharing scheme of N and \(t_{i}=T_{i}(X_{i})\), \(i\in N\). Then, by Theorem 1, there exist \(z_{i}\in \mathbb {R}\), \(i\in N\), with \(\sum _{i\in N}z_{i}=0\) such that
Therefore,
Suppose that (10) is not true, i.e., that \(\sum \limits _{i\in S} t_{i}< -\frac{1}{\alpha _{S}}\ln E[\exp (-\alpha _{S} \varPi (S, q_{S}^{\star }))]\) holds for some \(\emptyset \ne S\subseteq N\). Then, from Lemma 4 of (Baton and Lemaire, 1981), there exist \(t_{i}'\in \mathbb {R}\), \(i\in S\), such that \(t_{i}<t_{i}'\) and
For \(i\in S\), we define
and
Then, we have \(T_{i}(X_{i}')=t_{i}'>t_{i}=T_{i}(X_{i})\) for \(i\in S\). Consequently, \(U_{i}(X_{i}')>U_{i}(X_{i})\) for \(i\in S\). This means \((X_{i})_{i\in N}\) is not Pareto-optimal, which leads to a contradiction. This completes the proof of sufficiency.
Now, let \(t_{i}\), \(i\in N\), be real numbers that satisfy (9) and (10). For \(i\in N\), define
and
Then, \((X_{i})_{i\in N}\) is a Pareto-optimal risk sharing scheme of N. Suppose that \((X_{i})_{i\in N}\) is not stable, then there is a coalition \(S\subseteq N\) such that \((X_{i}')_{i\in S}\) is a Pareto-optimal risk sharing scheme of S that dominates \((X_{i})_{i\in N}\), i.e., \(U_{i}(X_{i}')>U_{i}(X_{i})\) for \(i\in S\). Consequently, \(T_{i}(X_{i}')>T_{i}(X_{i})\) for \(i\in S\) and \(\sum \limits _{i\in S} T_{i}(X_{i}')>\sum \limits _{i\in S} T_{i}(X_{i})\). Since \((X_{i}')_{i\in S}\) is a Pareto-optimal risk sharing scheme of S, we have
By calculation, we obtain \(T_{i}(X_{i})=t_{i}\) for \(i\in S\). Therefore,
which leads to a contradiction. Therefore, \((X_{i})_{i\in N}\) must be stable. This completes the proof of necessity. \(\square \)
Proof of Theorem 2
From Lemma 2, the core is nonempty if and only if the following system has a feasible solution:
where \(t_{i}\in \mathbb {R}\), for \(i\in N\). From the Bondareva–Shapley Theorem (Bondareva 1963; Shapley 1967) , (17) has a feasible solution if and only if
for all possible functions \(\lambda {:}\,2^{N}\setminus \emptyset \rightarrow \mathbb {R}_{+}\) with \(\sum \limits _{\begin{array}{c} S: i\in S, \emptyset \ne S\subseteq N \end{array}}\lambda (S)=1\), for \(i\in N\), where \(\mathbb {R}_{+}\) is the set of nonnegative real numbers.
To verify (18), we need the inequality
where \(t_{i}>0\), \(\sum \limits _{i=1}^{m}t_{i}=1\), m is a positive integer, and \(Z_{i}\) is a random variable for each \(1\le i\le m\). Note that
Consequently,
This finishes the proof. \(\square \)
Proof of Theorem 3
Suppose \((X_{i})_{i\in S}\) is a Pareto-optimal risk sharing scheme of S. Then there exists an order \(q\ge 0\) such that \(\sum _{i\in S} X_{i}=\varPi (S, q)\). From Sect. 3.1, there exist \(a_{i}>0\), \(i\in S\) with \(\sum _{i\in S} a_{i}=1\) such that \((X_{i})_{i\in S}\) is the solution of (4) and (5). From Gerber and Pafum (1998), for the power utilities (11), we have
From (11), when newsvendor \(i\in S\) has a profit \(X_{i}\), his maximum expected utility is reached at
Since we do not assume a specific distribution for the demand of each newsvendor, there is no explicit expression for \(\arg \max \limits _{q\ge 0} -E\big [\sum _{j\in S}s_{j}-\varPi (S, q)\big ]^{b+1}\). In Lemma 1, let \(v(x)=-(\sum _{i\in S}s_{i}-x)^{b+1}\), for \(x<\sum _{i\in S}s_{i}\). Then we can see that \(-E\big [\sum _{i\in S}s_{i}-\varPi (S, q)\big ]^{b+1}\) is a strictly concave function of q, for \(q\ge 0\). Therefore,
is unique.
Moreover,
Therefore, every newsvendor \(i\in S\) obtains his maximum expected utility at the same order \(q_{S}^{\star \star }\) given by (12). Since \((X_{i})_{i\in S}\) is a Pareto-optimal risk sharing scheme of coalition S, we have \(q=q^{\star \star }\) and
For each \(i\in S\), let \(z_{i}=\frac{\frac{s_{i}}{a_{i}^{1/b}}}{\sum _{j\in S}\frac{s_{j}}{a_{j}^{1/b}}}\), for \(i\in S\). It is obvious that \(\sum _{i\in S} z_{i}=1\). Hence \((X_{i})_{i\in S}\) is an element of (13).
Suppose \((X_{i})_{i\in S}\) is an element of (13), i.e., there exist \(z_{i}>0\), \(i\in S\), with \(\sum _{i\in S} z_{i}=1\) such that
It is easy to verify that there exist \(a_{i}>0\), \(i\in S\), with \(\sum _{i\in S} a_{i}=1\) such that \(z_{i}=\frac{\frac{s_{i}}{a_{i}^{1/b}}}{\sum _{j\in S}\frac{s_{j}}{a_{j}^{1/b}}}\), for \(i\in S\). From Sect. 3.1, corresponding to \(a_{i}>0\), \(i\in S\), there is a Pareto-optimal risk sharing scheme \((X_{i}')_{i\in S}\), where
for \(i\in S\) and some \(q\ge 0\). We can verify that \(q=q_{S}^{\star \star }\). Hence \(X_{i}=X_{i}'\), for \(i\in S\), and \((X_{i})_{i\in S}\) is a Pareto-optimal risk sharing scheme of S.
Consequently, the set of Pareto-optimal risk sharing schemes of S is given by (13). Moreover, the Pareto-optimal order of S is given by (12). \(\square \)
Proof of Lemma 3
For newsvendor \(i\in N\), let
where \(X_{i}\) is the profit of i. Note that for two possible profits of newsvendor i, \(X_{i}\) and \(X_{i}'\), we know \(T_{i}(X_{i})\ge T_{i}(X_{i}')\) if and only if \(U_{i}(X_{i})\ge U_{i}(X_{i}')\).
Let \((X_{i})_{i\in N}\) be a Pareto-optimal risk sharing scheme in N and let \(t_{i}=T_{i}(X_{i})\), for \(i\in N\). Then, by Theorem 3, there exist \(z_{i}>0\), \(i\in N\), with \(\sum _{i\in N}z_{i}=1\) such that
Consequently, we have
Suppose (15) is not true, i.e., that \(\sum \nolimits _{i\in S} t_{i}< -\big (E\big [\sum _{i\in S}s_{i}-\varPi (S, q_{S}^{\star \star })\big ]^{b+1}\big )^{\frac{1}{b+1}}\) holds for some \(\emptyset \ne S\subseteq N\). Then, from Lemma 4 of (Baton and Lemaire, 1981), there exist \(t_{i}'\in \mathbb {R}\), \(i\in S\), such that \(t_{i}<t_{i}'\) for \(i\in S\) and
For \(i\in S\), define
and
Therefore, \(T_{i}(X_{i}')=t_{i}'>t_{i}=T_{i}(X_{i})\), for \(i\in S\). Consequently, \(U_{i}(X_{i}')>U_{i}(X_{i})\), for \(i\in S\), and \((X_{i})_{i\in N}\) is not a Pareto-optimal risk sharing scheme, which leads to a contradiction. This finishes the proof of sufficiency.
Let \(t_{i}\), \(i\in N\), be real numbers that satisfy (14) and (15). For \(i\in N\), define
and
Then, \((X_{i})_{i\in N}\) is a Pareto-optimal risk sharing scheme. Suppose that \((X_{i})_{i\in N}\) is not stable, then there is a coalition \(S\subseteq N\) such that \((X_{i}')_{i\in S}\) is a Pareto-optimal risk sharing scheme of S and \((X_{i}')_{i\in S}\) dominates \((X_{i})_{i\in N}\), i.e., \(U_{i}(X_{i}')>U_{i}(X_{i})\), for \(i\in S\). Consequently, \(T_{i}(X_{i}')>T_{i}(X_{i})\), for \(i\in S\), and \(\sum \limits _{i\in S} T_{i}(X_{i}')>\sum \limits _{i\in S} T_{i}(X_{i})\). Since \((X_{i}')_{i\in S}\) is a Pareto-optimal risk sharing scheme in S, we have
By calculation, we have \(T_{i}(X_{i})=t_{i}\), for \(i\in S\). Therefore,
which leads to a contradiction. Hence \((X_{i})_{i\in N}\) must be stable. This finishes the proof of necessity. \(\square \)
Proof of Theorem 3
From Lemma 3, \(\mathcal {C}\big (N, \varPi (\cdot , \cdot , \cdot ), \varvec{u}(\cdot )\big )\ne \emptyset \) if and only if the following system has a solution:
where \(t_{i}<0\) \(i\in N\), are variables.
From the Bondareva–Shapley Theorem, system (19) has a solution if and only if
for all possible functions \(\lambda {:}\,2^{N}\setminus \emptyset \rightarrow \mathbb {R}_{+}\) with \(\sum \nolimits _{\begin{array}{c} S: i\in S, \emptyset \ne S\subseteq N \end{array}}\lambda (S)=1\), for \(i\in N\).
Using the Minkowski Inequality, we have
Thus inequality (20) is satisfied and the proof is complete. \(\square \)
Rights and permissions
About this article
Cite this article
Zhang, J., Fang, SC. & Xu, Y. Inventory centralization with risk-averse newsvendors. Ann Oper Res 268, 215–237 (2018). https://doi.org/10.1007/s10479-017-2578-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-017-2578-0