Minimum cost spanning tree problems with groups
- 117 Downloads
We study minimum cost spanning tree problems with groups. We assume that agents are located in different villages, cities, etc. The groups are the agents of the same village. We introduce a rule for dividing the cost of connecting all agents to the source among the agents taking into account the group structure. We characterize this rule with several desirable properties. We prove that this rule coincides with the Owen value of the TU game associated with the irreducible matrix.
KeywordsMinimum cost spanning tree problems Coalitional value Cost allocation
JEL ClassificationC71 D70 D85
Unable to display preview. Download preview PDF.
- Bergantiños G., Lorenzo L.: A non-cooperative approach to the cost spanning tree problem. Math Methods Oper Res 59, 393–403 (2004)Google Scholar
- Bergantiños, G., Vidal-Puga, J.J.: Realizing Fair Outcomes in Minimum Cost Spanning Tree Problems Through Non-Cooperative Mechanisms. Mimeo: University of Vigo (2007c). Available at http://webs.uvigo.es/gbergant/papers/cstnoncoop.pdf
- Feltkamp V., Tijs S., Muto S.: On the Irreducible Core and the Equal Remaining Obligation Rule of Minimum Cost Extension Problems. Tilburg University, Mimeo (1994)Google Scholar
- Ju, Y., Wettstein, D.: Implementing cooperative solution concepts: a generalized bidding approach, Economic Theory (forthcoming). doi: 10.1007/s00199-008-0335-y (2009)
- Owen G.: Values of games with a priori unions. In: Henn, R.O., Moeschlin, O. (eds) Essays in Mathematical Economics and Game Theory, pp. 76–88. Springer, New York (1977)Google Scholar
- Prim R.C.: Shortest connection networks and some generalizations. Bell Syst Technol J 36, 1389–1401 (1957)Google Scholar
- Shapley, L.S.: A value for n-person games. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games II, pp. 307–317. Princeton (1953)Google Scholar