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! ]

Minimum cost arborescences

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

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

Abstract

In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well-studied problem of minimum cost spanning tree games, where the costs are assumed to be symmetric. The focus is on rules which satisfy axioms representing incentive and fairness properties. We show that while some results are similar, there are also signilcant dikerences between the frameworks corresponding to symmetric and asymmetric cost matrices.

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/dp08-12.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 08-12.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 30 pages
Date of creation: Dec 2008
Date of revision:
Handle: RePEc:ind:isipdp:08-12

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: directed networks; cost allocation; core stability; continuity; cost monotonicity;

Other versions of this item:

Find related papers by JEL classification:
D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation
C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General

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. Feltkamp, V. & Tijs, S. & Muto, S., 1994. "On the Irreducible Core and the Equal Remaining Obligations Rule of Minimum Cost Spanning Extension Problems," Discussion Paper 106, Tilburg University, Center for Economic Research. [Downloadable!]
  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. Norde, H. & Moretti, S. & Tijs, S., 2001. "Minimum cost spanning tree games and population monotonic allocation schemes," Discussion Paper 18, Tilburg University, Center for Economic Research. [Downloadable!]
    Other versions:
  4. Dutta, Bhaskar & Kar, Anirban, 2004. "Cost monotonicity, consistency and minimum cost spanning tree games," Games and Economic Behavior, Elsevier, vol. 48(2), pages 223-248, August. [Downloadable!] (restricted)
    Other versions:
  5. 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)
Full references

Statistics
Access and download statistics

Did you know? IDEAS is not the only service displaying RePEc data. Choose on RePEc which service fits your needs best.

This page was last updated on 2009-12-3.

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.