Location of Repository

Minimum cost arborescences

By Bhaskar Dutta and Debasis Mishra

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 signifcant differences between the frameworks corresponding to symmetric and asymmetric cost matrices

Topics: HF
Publisher: University of Warwick, Department of Economics
Year: 2009
OAI identifier: oai:wrap.warwick.ac.uk:1328

Suggested articles

Preview

Citations

  1. (2007c): \Several Approaches to the Same Rule in Minimum Cost Spanning Tree Problems,"Working Paper,
  2. (2002). Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games," doi
  3. (2008). Beyond the Folk Solution in the Minimum Cost Spanning Tree Problem,"Working Paper, doi
  4. (1971). Cores of Convex Games," doi
  5. (2004). Cost Monotonicity, Consistency and Minimum Cost Spanning Tree Games," doi
  6. (2001). Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes," doi
  7. (2008). Obligation Rules,"Working Paper,
  8. (1976). On Cost Allocation of a Spanning Tree: A Game Theoretic Approach," doi
  9. (1994). On the Irreducible Core and the Equal Remaining Obligations Rule of Minimum Cost Spanning Extension Problems," Working Paper,
  10. (1965). On the Shortest Arborescence of a Directed Graph,"
  11. (1967). Optimum Branchings," doi
  12. (2008). Sharing the Cost of a Capacity Network," Working Paper,
  13. (1997). Sharing the Cost of Multicast Trees: An Axiomatic Analysis," doi
  14. (2005). The Bird Core for Minimum Cost Spanning Tree Problems Revisited: Monotonicity and Additivity Aspects," Working Paper, doi
  15. The Optimistic TU Game in Minimum Cost Spanning Tree Problems," doi
  16. (2004). The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations," Theory and Decision, doi
  17. Vidal-Puga (2007a): \A Fair Rule for Minimum Cost Spanning Tree Problems," doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.