We provide a direct proof of a representation theorem for additive cost sharing methods as sums of path methods. Also, by directly considering the paths that generate some common additive cost sharing methods (Aumann-Shapley, Shapley Shubik, and Serial Cost) we show that they are consistent. These results follow directly from a simple sufficient condition for consistency: being generated by an associative path. We also introduce a new axiom, dummy consistency, which is quite mild. Using this, we also show that the Aumann-Shapley and Serial Cost methods are the unique (additive) consistent extension of their restriction on all two agent problems, while the Shapley-Shubik method has multiple consistent extensions but a unique anonymous scale invariant one. Copyright Springer-Verlag 2004
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
For technical questions regarding this item, or to correct its listing, contact: (Christopher F Baum).
Related research
Keywords:
Other versions of this item:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)