Minimum cost arborescences

Bhaskar Dutta () and Debasis Mishra ()
Additional contact information
Debasis Mishra: Indian Statistical Institute, New Delhi

Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers from Indian Statistical Institute, New Delhi, India

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.

Keywords: directed networks; cost allocation; core stability; continuity; cost monotonicity (search for similar items in EconPapers)
JEL-codes: D85 C70 (search for similar items in EconPapers)
Date: 2008-12

Downloads: (external link)
http://www.isid.ac.in/~pu/dispapers/dp08-12.pdf (application/pdf)

Related works:
Working Paper: Minimum Cost Arborescences (2009)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:ind:isipdp:08-12

Access Statistics for this paper

More papers in Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers from Indian Statistical Institute, New Delhi, India
Contact information at EDIRC.
Series data maintained by Shamprasad M. Pujar ().