Sensibility concept for the discrete case in the cost sharing problem

DOI10.15517/RMTA.V20I2.11647MaRDI QIDQ5262594zbMATH OpenOpenAlexFDO

Authors Julio César MacÍas Ponce, F. Sánchez-Sánchez, Luis Hernández Lamoneda

Publication date 16 July 2015

Published in Revista de Matemática: Teoría y Aplicaciones (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.15517/rmta.v20i2.11647

zbMATH Keywords

cooperative gamescost sharingaxiomatic solutionssensibilitypath-induced solutions

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Production theory, theory of the firm (91B38)

Recommendations

• Monotonicity and the Aumann-Shapley cost-sharing method in the discrete case
• Consistent cost sharing
• A solution for discrete cost sharing problems with non rival consumption
• Axiomatizations of game theoretical solutions for one-output cost sharing problems
• Cost sharing: The nondifferentiable case

This page was built for publication: Sensibility concept for the discrete case in the cost sharing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262594)