Coherent Cost-Sharing Rules
We reconsider the discrete version of the axiomatic cost-sharing model. We propose a condition of (informational) coherence requiring that not all informational refinements of a given problem be solved differently from the original problem. We prove that strictly coherent linear cost-sharing rules must be simple random-order rules.
|Date of creation:||1999|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: (514) 343-6540
Fax: (514) 343-5831
Web page: http://www.sceco.umontreal.ca
More information through EDIRC
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.:
- E. Loehman & A. Whinston, 1974. "An Axiomatic Approach to Cost Allocation for Public Investment," Public Finance Review, , vol. 2(2), pages 236-250, April.
- Moulin Herve & Shenker Scott, 1994. "Average Cost Pricing versus Serial Cost Sharing: An Axiomatic Comparison," Journal of Economic Theory, Elsevier, vol. 64(1), pages 178-201, October.
- Moulin, Herve & Shenker, Scott, 1992. "Serial Cost Sharing," Econometrica, Econometric Society, vol. 60(5), pages 1009-37, September.
- HervÊ Moulin, 1999. "Incremental cost sharing: Characterization by coalition strategy-proofness," Social Choice and Welfare, Springer, vol. 16(2), pages 279-320.
- Martin Shubik, 1961.
"Incentives, Decentralized Control, the Assignment of Joint Costs and Internal Pricing,"
Cowles Foundation Discussion Papers
112, Cowles Foundation for Research in Economics, Yale University.
- Martin Shubik, 1962. "Incentives, Decentralized Control, the Assignment of Joint Costs and Internal Pricing," Management Science, INFORMS, vol. 8(3), pages 325-343, April.
- Sprumont, Y., 1996.
"Ordinal Cost Sharing,"
Cahiers de recherche
9624, Universite de Montreal, Departement de sciences economiques.
- Friedman, Eric & Moulin, Herve, 1999.
"Three Methods to Share Joint Costs or Surplus,"
Journal of Economic Theory,
Elsevier, vol. 87(2), pages 275-312, August.
- S. C. Littlechild & G. Owen, 1973. "A Simple Expression for the Shapley Value in a Special Case," Management Science, INFORMS, vol. 20(3), pages 370-372, November.
- Young, H.P., 1994. "Cost allocation," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 2, chapter 34, pages 1193-1235 Elsevier.
- Hervé Moulin, 1995.
"On Additive Methods To Share Joint Costs,"
The Japanese Economic Review,
Japanese Economic Association, vol. 46(4), pages 303-332, December.
- Wang, YunTong, 1999. "The additivity and dummy axioms in the discrete cost sharing model," Economics Letters, Elsevier, vol. 64(2), pages 187-192, August.
- Pradeep Dubey & Robert J. Weber, 1977.
"Probabilistic Values for Games,"
Cowles Foundation Discussion Papers
471, Cowles Foundation for Research in Economics, Yale University.
- Henriet, D. & Moulin, H., 1993.
"Traffic Based Cost Allocation in Network,"
93a19, Universite Aix-Marseille III.
- repec:ner:tilbur:urn:nbn:nl:ui:12-78039 is not listed on IDEAS
- Aadland, David & Kolpin, Van, 1998. "Shared irrigation costs: An empirical and axiomatic analysis," Mathematical Social Sciences, Elsevier, vol. 35(2), pages 203-218, March.
- Kolpin, Van, 1996. "Multi-Product Serial Cost Sharing: An Incompatibility with the Additivity Axiom," Journal of Economic Theory, Elsevier, vol. 69(1), pages 227-233, April.
- Koster, Maurice & Tijs, Stef & Borm, Peter, 1998. "Serial cost sharing methods for multi-commodity situations," Mathematical Social Sciences, Elsevier, vol. 36(3), pages 229-242, December.
When requesting a correction, please mention this item's handle: RePEc:mtl:montde:9902. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sharon BREWER)
If references are entirely missing, you can add them using this form.