Minimum Cost Arborescences

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

Minimum cost arborescences

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