4 resultados para Photo Sharing
Resumo:
Revised: 2006-06
Resumo:
In this study we define a cost sharing rule for cost sharing problems. This rule is related to the serial cost-sharing rule defined by Moulin and Shenker (1992). We give some formulas and axiomatic characterizations for the new rule. The axiomatic characterizations are related to some previous ones provided by Moulin and Shenker (1994) and Albizuri (2010).
Resumo:
In this paper we give a generalization of the serial cost-sharing rule defined by Moulin and Shenker (1992) for cost sharing problems. According to the serial cost sharing rule, agents with low demands of a good pay cost increments associated with low quantities in the production process of that good. This fact might not always be desirable for those agents, since those cost increments might be higher than others, for example with concave cost functions. In this paper we give a family of cost sharing rules which allocates cost increments in all the possible places in the production process. And we characterize axiomatically each of them by means of an axiomatic characterization related to the one given for the serial cost-sharing rule by Moulin and Shenker (1994).
Resumo:
In this paper we introduce a new cost sharing rule-the minimal overlap cost sharing rule-which is associated with the minimal overlap rule for claims problems defined by O'Neill (1982). An axiomatic characterization is given by employing a unique axiom: demand separability. Variations of this axiom enable the serial cost sharing rule (Moulin and Shenker, 1992) and the rules of a family (Albizuri, 2010) that generalize the serial cost sharing rule to be characterized. Finally, a family that includes the minimal overlap cost sharing rule is defined and obtained by means of an axiomatic characterization.