IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this paper or follow this series

Cost monotonicity, consistency and minimum cost spanning tree games

  • Bhaskar Dutta

    ()

    (University of Warwick)

  • Anirban Kar

    ()

    (Indian Statistical Institute, New Delhi)

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.

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.

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

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.

as
in new window

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/~pu/

More information through EDIRC

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

as in new window
  1. Thomson, W., 1998. "Consistency and its Converse: an Introduction," RCER Working Papers 448, University of Rochester - Center for Economic Research (RCER).
  2. 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.
  3. Peleg, B, 1986. "On the Reduced Game Property and Its Converse," International Journal of Game Theory, Springer, vol. 15(3), pages 187-200.
  4. Daniel Granot & Michael Maschler, 1998. "Spanning network games," International Journal of Game Theory, Springer, vol. 27(4), pages 467-500.
  5. Sharkey, W.W., 1991. "Network Models in Economics," Papers 69, Bell Communications - Economic Research Group.
  6. Hart, Sergiu & Mas-Colell, Andreu, 1989. "Potential, Value, and Consistency," Econometrica, Econometric Society, vol. 57(3), pages 589-614, May.
  7. 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.
Full references (including those not matched with items on IDEAS)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:ind:isipdp:02-04. 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: (Shamprasad M. Pujar)

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.