Revista de Matemática: Teoría y Aplicaciones ISSN Impreso: 1409-2433 ISSN electrónico: 2215-3373

OAI: https://revistas.ucr.ac.cr/index.php/matematica/oai
Sensibility concept for the discrete case in the cost sharing problem
PDF (Español (España))

Keywords

cost sharing
axiomatic solutions
path-induced solutions
cooperative games
sensibility
distribución de costos
soluciones inducidas por caminos
juegos cooperativos
sensibilidad

How to Cite

Hernández Lamoneda, L., Macías Ponce, J. C., & Sánchez Sánchez, F. (2013). Sensibility concept for the discrete case in the cost sharing problem. Revista De Matemática: Teoría Y Aplicaciones, 20(2), 119–131. https://doi.org/10.15517/rmta.v20i2.11647

Abstract

Suppose that a vector is produced jointly. We will consider the problem of dividing the cost of production among a group of components. In this paper we characterized a solution through two axioms, s-sensibility and separability. The sensibility is a concept related to the variations of a solution due to slight changes of the cost function and the separability is standard. We study the discrete cost sharing problem. We provide a axiomatic solution.

https://doi.org/10.15517/rmta.v20i2.11647
PDF (Español (España))

References

Macías, J.; Olvera, W. (2012) “A Nash equilibrium solution for the discrete two-person cost sharing problem”, Applied Mathematical Sciences 6(42): 2063–2070.

Moulin, H. (1995) “On additive methods to share joint costs”, The Japanese Economic Review 46: 303–332.

Nouweland, A.; Tijs, S. (1995) “Cores and related solution concepts for multi-choice games”, Mathematical Methods of Operations Research 41: 289–311.

Sprumont, Y. (2008) “Nearly serial sharing methods”, International Journal of Game Theory 37: 155-184.

Comments

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Copyright (c) 2013 Revista de Matemática: Teoría y Aplicaciones

Downloads

Download data is not yet available.