An efficient and almost budget balanced cost sharing method
For a convex technology C we characterize cost sharing games where the Nash equilibrium demands maximize total surplus. Budget balance is possible if and only if C is polynomial of degree n-1 or less. For general C, the residual* cost shares are balanced if at least one demand is null, a characteristic property. If the cost function is totally monotone, a null demand receives cash and total payments may exceed actual cost. The ratio of excess payment to efficient surplus is at most . For power cost functions, C(a)=ap, p>1, the ratio of budget imbalance to efficient surplus vanishes as . For analytic cost functions, the ratio converges to zero exponentially along a given sequence of users. All asymptotic properties are lost if the cost function is not smooth.
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
References listed on IDEAS
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.:
- HervÈ CrËs & HervÈ Moulin, 2003.
"Commons with increasing marginal costs: random priority versus average cost,"
International Economic Review,
Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 44(3), pages 1097-1115, 08.
- Moulin, Herve & Cres, Herve, 2000. "Commons with Increasing Marginal Costs: Random Priority versus Average Cost," Working Papers 2000-04, Rice University, Department of Economics.
- Moulin, Herve & Shenker, Scott, 1992. "Serial Cost Sharing," Econometrica, Econometric Society, vol. 60(5), pages 1009-37, September.
- Manipushpak Mitra, 2000.
"Mechanism Design in Queueing Problems,"
Econometric Society World Congress 2000 Contributed Papers
1301, Econometric Society.
- Justin Leroux, 2006.
"Cooperative production under diminishing marginal returns: Interpreting fixed-path methods,"
Cahiers de recherche
06-10, HEC Montréal, Institut d'économie appliquée.
- Justin Leroux, 2007. "Cooperative production under diminishing marginal returns: interpreting fixed-path methods," Social Choice and Welfare, Springer, vol. 29(1), pages 35-53, July.
- Hervé Moulin, 2008. "The price of anarchy of serial, average and incremental cost sharing," Economic Theory, Springer, vol. 36(3), pages 379-405, September.
- Watts, Alison, 1996. "On the Uniqueness of Equilibrium in Cournot Oligopoly and Other Games," Games and Economic Behavior, Elsevier, vol. 13(2), pages 269-285, April.
- Monderer, Dov & Shapley, Lloyd S., 1996. "Potential Games," Games and Economic Behavior, Elsevier, vol. 14(1), pages 124-143, May.
- Hervé Moulin & Scott Shenker, 2001. "Strategyproof sharing of submodular costs:budget balance versus efficiency," Economic Theory, Springer, vol. 18(3), pages 511-533.
- Luis Corchón & M. Socorro Puy, 2000. "- Existence And Nash Implementation Of Efficient Sharing Rules For A Commonly Owned Technology," Working Papers. Serie AD 2000-03, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Kukushkin, Nikolai S., 2004. "Best response dynamics in finite games with additive aggregation," Games and Economic Behavior, Elsevier, vol. 48(1), pages 94-110, July.
- Monderer, Dov & Shapley, Lloyd S., 1996. "Fictitious Play Property for Games with Identical Interests," Journal of Economic Theory, Elsevier, vol. 68(1), pages 258-265, January.
- Luis C. Corchón & M. Socorro Puy, 2002. "Existence and Nash implementation of efficient sharing rules for a commonly owned technology," Social Choice and Welfare, Springer, vol. 19(2), pages 369-379, April.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:70:y:2010:i:1:p:107-131. 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: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.