Abstract
We introduce a new class of totally balanced cooperative TU games, namely p-additive games. It is inspired by the class of inventory games that arises from inventory situations with temporary discounts (Toledo Ph.D. thesis, Universidad Miguel Hernández de Elche, 2002) and contains the class of inventory cost games (Meca et al. Math. Methods Oper. Res. 57:481–493, 2003). It is shown that every p-additive game and its corresponding subgames have a nonempty core. We also focus on studying the character of concave or convex and monotone p-additive games. In addition, the modified SOC-rule is proposed as a solution for p-additive games. This solution is suitable for p-additive games, since it is a core-allocation which can be reached through a population monotonic allocation scheme. Moreover, two characterizations of the modified SOC-rule are provided.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bondareva ON (1963) Some applications of linear programming methods to the theory of cooperative games. Probl Kibern 10:119–139, in Russian
Granot DG, Huberman G (1982) The relation between convex games and minimal cost spanning tree games: a case for permutationally convex games. SIAM J Algebraic Discrete Methods 3:288–292
Meca A, García-Jurado I, Borm PEM (2003) Cooperation and competition in inventory games. Math Methods Oper Res 57:481–493
Meca A, Timmer J, García-Jurado I, Borm PEM (2004) Inventory games. Eur J Oper Res 156:127–139
Mosquera MA, García-Jurado I, Fiestras-Janeiro MG (2007) A note on coalitional manipulation and centralized inventory management. Ann Oper Res (to appear)
Shapley LS, (1953) A value for n-person games. In: Kuhn H, Tucker AW (eds) Contributions to the theory of games II. Princeton University Press, Princeton, pp 307–317
Shapley LS (1967) On balanced sets and cores. Nav Res Logist Quarterly 14:453–460
Shapley LS (1971) Cores of convex games. Int J Game Theory 1:11–26
Sprumont Y (1990) Population monotonic allocation schemes for cooperative games with transferable utility. Games Econ Behav 2:378–394
Tersine RJ (1994) Principles of inventory and material management. Elsevier/North-Holland, Amsterdam
Toledo A (2002) Problemas de inventario con descuento desde la perspectiva de la teoría de juegos. Ph.D. thesis, Universidad Miguel Hernández de Elche
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partially supported by the Spanish Ministry of Education and Science and Generalitat Valenciana (grants MTM2005-09184-C02-02, ACOMP06/040, CSD2006-00032). Authors acknowledge valuable comments made by the Editor and the referee.
Rights and permissions
About this article
Cite this article
Meca, A., Guardiola, L.A. & Toledo, A. p-additive games: a class of totally balanced games arising from inventory situations with temporary discounts. TOP 15, 322–340 (2007). https://doi.org/10.1007/s11750-007-0020-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-007-0020-5
Keywords
- p-additive games
- Inventory situations with temporary discounts
- Totally balanced cooperative TU games
- Modified SOC-rule
- Core-allocations