Arbeitspapier

Paths and Consistency in Additive Cost Sharing

Using a new representation theorem for additive cost sharing methods as sums of path methods, we show that many of the standard additive cost sharing methods (Aumann-Shapley, Shapley Shubik, and Serial Cost) are consistent. These results follow directly from a simple sufficient condition for consistency: being generated by associative paths, which can be used to show consistency for many other methods. We introduce a new axiom, dummy consistency, which is quite mild. Nonetheless there is an important relationship between dummy consistency and consistency. For example, we show that all additive cost sharing methods which are dummy consistent and demand monotonic are consistent. Using dummy consistency, 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 symmetric one. In fact, these results are unchanged when we replace consistency with dummy consistency. Our characterization of the set of dummy-consistent cost sharing methods provides a simple framework for analyzing consistent extensions and is useful for constructing nonsymmetric methods.

Sprache
Englisch

Erschienen in
Series: Working Paper ; No. 1999-23

Klassifikation
Wirtschaft
Thema
consistency
cost allocation
representation theorem

Ereignis
Geistige Schöpfung
(wer)
Friedman, Eric
Ereignis
Veröffentlichung
(wer)
Rutgers University, Department of Economics
(wo)
New Brunswick, NJ
(wann)
1999

Handle
Letzte Aktualisierung
10.03.2025, 11:44 MEZ

Datenpartner

Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.

Objekttyp

  • Arbeitspapier

Beteiligte

  • Friedman, Eric
  • Rutgers University, Department of Economics

Entstanden

  • 1999

Ähnliche Objekte (12)