zbMATH — the first resource for mathematics

The additivity and dummy axioms in the discrete cost sharing model. (English) Zbl 0971.91509
Summary: The paper considers the discrete cost sharing model first studied in H. Moulin’s paper [“On additive methods to share joint costs”, Jpn. Econ. Rev. 46, No. 4, 303–332 (1995; doi:10.1111/j.1468-5876.1995.tb00024.x)]. It shows that the set of additive rules satisfying the dummy axiom is the set of all convex combinations of the path generated rules.

91B32 Resource and cost allocation (including fair division, apportionment, etc.)
91A12 Cooperative games
Full Text: DOI
[1] Aumann, R.J.; Shapley, L., Values of nonatomic games, (1974), Princeton University Press · Zbl 0311.90084
[2] Friedman, E., 1998. Paths and consistency in additive cost sharing. Mimeo, Rutgers University. · Zbl 1098.91012
[3] Friedman, E., Moulin, H., 1997. Two methods to share joint costs or surplus. Mimeo, Duke University. · Zbl 1016.91056
[4] Garfinkel, R.S.; Nemhauser, G.L., Integer programming, (1972), John Wiley · Zbl 0271.90028
[5] Haimanko, O., 1998. Partially symmetric values. Mimeo, Hebrew University, Jerusalem. · Zbl 1073.91509
[6] Moulin, H., On additive methods to share joint costs, Japanese economic review, 46, 303-332, (1995)
[7] Shapley, L.S., A value for n-person games, (), 307-317 · Zbl 0050.14404
[8] Sprumont, Y., 1998. Coherent cost sharing. Mimeo. University of Montreal.
[9] Tauman, Y., The Aumann-Shapley prices: a survey, () · Zbl 0708.90009
[10] Weber, R., Probabilistic values for games, () · Zbl 0707.90100
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.