Abstract.
Inventory cost games are introduced in Meca et al. (1999). These games arise when considering the possibility of joint ordering in n-person EOQ inventory situations. Moreover, the SOC-rule is introduced and analysed as a cost allocation rule for this type of situations. In the current paper it is seen that n-person EPQ situations with shortages lead to exactly the same class of cost games. Furthermore, an alternative characterization of the SOC-rule is offered, primarily based on a transfer property which constitutes a special form of additivity. Necessary input variables for the SOC-rule are the (optimal) individual average number of orders per time unit in case there is no cooperation. Assuming that these average numbers are observable but not verifiable, we allow the players to select them strategically, while knowing that the SOC-rule will be (consecutively) applied as the cost allocation principle. Necessary and sufficient conditions are provided for the existence (and uniqueness) of a so-called constructive equilibrium in which all players make joint orders.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Manuscript received: July 2002/Final version received: September 2002
RID="*"
ID="*" This work was partially supported by the Spanish Ministry for Education and Culture (grant PB98-0613-C02-02). Peter Borm and Ignacio García-Jurado gratefully acknowledge the support by the Center of Operations Research (CIO) of the Miguel Hernández University. Authors thank Fioravante Patrone for his comments.
Rights and permissions
About this article
Cite this article
Meca, A., García-Jurado, I. & Borm, P. Cooperation and competition in inventory games. Mathematical Methods of OR 57, 481–493 (2003). https://doi.org/10.1007/s001860200253
Issue Date:
DOI: https://doi.org/10.1007/s001860200253