Abstract

We study cooperation between a group of companies, who need spare parts to maintain their expensive equipment, by pooling their spare parts inventory. To establish a stable cooperation, the cost of running the pooled inventory should be allocated between the participating members in a fair fashion. To address this cost allocation problem, we borrow concepts from cooperative game theory and examine the core of the resulting cooperative games. We first show that under standard cost structure, the system with expedited deliveries is equivalent to the well studied (S-1,S) inventory system with backlogging. Afterwards, we derive several properties of the performance measures (i.e., expected number of inventory and back orders, and average number of back orders) that play an important role in subsequent study of the cores of the corresponding games. We study three cooperation scenarios: (i) cooperation by inventory pooling, (ii) cooperation under optimal inventory investment, and (iii) cooperation under service level constraint. For many of these games, we show that the cores are non-empty by identifying a PMAS. For the games with empty cores, we present examples. Afterwards, we extend our analysis to games with joint capacity investment and the games resulting from several approximations of the demand including normal approximation. Finally, we derive an easy to calculate allocation scheme for news-vendor games with normally distributed demand.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.