This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Cost monotonicity, consistency and minimum cost spanning tree games

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Bhaskar Dutta () (University of Warwick)
Anirban Kar () (Indian Statistical Institute, New Delhi)

Additional information is available for the following registered author(s):

Abstract

We propose a new cost allocation rule for minimum cost Spanning tree games. The new rule is a core selection and also satisfices cost monotonicity. We also give charqcterization theorems for the new rule as well as the much-studied Bird allocation. We show that the principal difference between these two rules is interms of their consistency properties.

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.

File URL: http://www.isid.ac.in/~pu/dispapers/dp02-04.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Indian Statistical Institute, New Delhi, India in its series Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers with number 02-04.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 38 pages
Date of creation: Jul 2002
Date of revision:
Handle: RePEc:ind:isipdp:02-04

Contact details of provider:
Postal: 7, S. J. S. Sansanwal Marg, New Delhi - 110016
Phone: 91-11-6564789
Fax: 91-11-6856779
Web page: http://www.isid.ac.in
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Shamprasad M. Pujar).

Related research
Keywords: spanning tree; cost allocation; core selection; cost monotonicity; consistency;

Other versions of this item:

Find related papers by JEL classification:
D7 - Microeconomics - - Analysis of Collective Decision-Making

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.:

  1. Peleg, B, 1986. "On the Reduced Game Property and Its Converse," International Journal of Game Theory, Springer, vol. 15(3), pages 187-200.
  2. Kar, Anirban, 2002. "Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games," Games and Economic Behavior, Elsevier, vol. 38(2), pages 265-277, February. [Downloadable!] (restricted)
  3. Daniel Granot & Michael Maschler, 1998. "Spanning network games," International Journal of Game Theory, Springer, vol. 27(4), pages 467-500. [Downloadable!] (restricted)
  4. 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. [Downloadable!] (restricted)
  5. Hart, Sergiu & Mas-Colell, Andreu, 1989. "Potential, Value, and Consistency," Econometrica, Econometric Society, vol. 57(3), pages 589-614, May. [Downloadable!] (restricted)
Full references

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.)

  1. Gustavo Bergantiños & Silvia Lorenzo-Freire, 2008. "A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems," Economic Theory, Springer, vol. 35(3), pages 523-538, June. [Downloadable!] (restricted)
  2. Gustavo Bergantiños & Juan Vidal-Puga, 2004. "Realizing efficient outcomes in cost spanning problems," Game Theory and Information 0403001, EconWPA. [Downloadable!]
  3. Ciftci, B.B. & Tijs, S.H., 2007. "A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems," Discussion Paper 2007-89, Tilburg University, Center for Economic Research. [Downloadable!]
  4. Branzei, R. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2003. "The p-value for cost sharing in minimum cost spanning tree situations," Discussion Paper 129, Tilburg University, Center for Economic Research. [Downloadable!]
  5. Gomez-Rua, Maria & Vidal-Puga, Juan, 2006. "No advantageous merging in minimum cost spanning tree problems," MPRA Paper 601, University Library of Munich, Germany. [Downloadable!]
  6. Dutta, Bhaskar & Mishra, Debasis, 2009. "Minimum Cost Arborescences," The Warwick Economics Research Paper Series (TWERPS) 889, University of Warwick, Department of Economics. [Downloadable!]
    Other versions:
  7. Gustavo Bergantiños & Juan Vidal-Puga, 2004. "Additivity in cost spanning tree problems," Game Theory and Information 0405001, EconWPA. [Downloadable!]
  8. Gustavo Bergantiños & Juan Vidal-Puga, 2004. "Defining rules in cost spanning tree problems through the canonical form," Game Theory and Information 0402004, EconWPA. [Downloadable!]
    Other versions:
  9. Tijs, S.H. & Branzei, R. & Moretti, S. & Norde, H.W., 2004. "Obligation rules for minimum cost spanning tree situations and their monotonicity properties," Discussion Paper 53, Tilburg University, Center for Economic Research. [Downloadable!]
    Other versions:
  10. Gustavo Bergantinos & Juan Vidal-Puga, 2008. "On Some Properties of Cost Allocation Rules in Minimum Cost Spanning Tree Problems," AUCO Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 2(3), pages 251-267, December. [Downloadable!]
  11. Jens Leth Hougaard & Hervé Moulin & Lars Peter Østerdal, 2008. "Decentralized Pricing in Minimum Cost Spanning Trees," Discussion Papers 08-24, University of Copenhagen. Department of Economics. [Downloadable!]
  12. Gustavo Bergantiños & Juan Vidal-Puga, 2007. "The optimistic TU game in minimum cost spanning tree problems," International Journal of Game Theory, Springer, vol. 36(2), pages 223-239, October. [Downloadable!] (restricted)
Statistics
Access and download statistics

Did you know? Citation analysis on IDEAS includes online papers that are freely accessible and whose text could be automatically analyzed, currently about 210000 papers.

This page was last updated on 2009-11-7.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.