Author
Listed:
- René Caldentey
(Booth School of Business, The University of Chicago, Chicago, Illinois 60637)
- Avi Giloni
(Sy Syms School of Business, Yeshiva University, New York, New York 10033)
- Clifford Hurvich
(Stern School of Business, New York University, New York, New York 10012)
- Yichen Zhang
(Daniels School of Business, Purdue University, West Lafayette, Indiana 47907)
Abstract
We study the interplay between inventory replenishment policies and information sharing in the context of a two-tier supply chain with a single supplier and a single retailer serving an independent and identically distributed Gaussian market demand. We investigate how the retailer’s inventory policy impacts the supply chain’s cumulative expected long-term average inventory costs C in two extreme information-sharing cases: (a) full information sharing and (b) no information sharing. To find the retailer’s inventory policy that minimizes C , we formulate an infinite-dimensional optimization problem whose decision variables are the MA( ∞ ) coefficients that characterize a stationary ordering policy. Under full information sharing, the optimization problem admits a simple solution and the optimal policy is given by an MA(1) process. On the other hand, to solve the optimization problem under no information sharing, we reformulate the optimization from its time domain formulation to an equivalent z -transform formulation in which the decision variables correspond to elements of the Hardy space H 2 . This alternative representation allows us to use a number of results from H 2 theory to compute the optimal value of C and characterize a sequence of ϵ -optimal inventory policies under some mild technical conditions. By comparing the optimal solution under full information sharing and no information sharing, we derive a number of important practical takeaways. For instance, we show that there is value in information sharing if and only if the retailer’s optimal policy under full information sharing is not invertible with respect to the sequence of demand shocks. Furthermore, we derive a fundamental mathematical identity that reveals the value of information sharing by exploiting the canonical Smirnov–Beurling inner–outer factorization of the retailer’s orders when viewed as an element of H 2 . We also show that the value of information sharing can grow unboundedly when the cumulative supply chain costs are dominated by the supplier’s inventory costs.
Suggested Citation
René Caldentey & Avi Giloni & Clifford Hurvich & Yichen Zhang, 2025.
"Information Design and Sharing in Supply Chains,"
Mathematics of Operations Research, INFORMS, vol. 50(3), pages 1965-1991, August.
Handle:
RePEc:inm:ormoor:v:50:y:2025:i:3:p:1965-1991
DOI: 10.1287/moor.2023.0008
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:50:y:2025:i:3:p:1965-1991. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.