The Library
Cost monotonicity, consistency and minimum cost spanning tree games
Tools
Tools
Tools
Dutta, Bhaskar and Kar, Anirban (2002) Cost monotonicity, consistency and minimum cost spanning tree games. Working Paper. Coventry: University of Warwick, Department of Economics. (Warwick economic research papers.
![[img]](http://wrap.warwick.ac.uk/style/images/fileicons/application_pdf.png)
|
PDF
WRAP_Dutta_twerp629.pdf - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader Download (202Kb) |
Official URL: http://www2.warwick.ac.uk/fac/soc/economics/resear...
Abstract
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core selection and also satisfies cost monotonicity. We also give characterization theorems for the new rule as well as the much-studied Bird allocation. We show that the principal difference between these two rules is in terms of their consistency properties.
| Item Type: | Working or Discussion Paper (Working Paper) |
|---|---|
| Subjects: | H Social Sciences > HF Commerce |
| Divisions: | Faculty of Social Sciences > Economics |
| Library of Congress Subject Headings (LCSH): | Cost allocation, Cost accounting, Monotonic functions, Spanning trees (Graph theory) |
| Series Name: | Warwick economic research papers |
| Publisher: | University of Warwick, Department of Economics |
| Place of Publication: | Coventry |
| Date: | January 2002 |
| Number: | No.629 |
| Number of Pages: | 36 |
| Status: | Not Peer Reviewed |
| Access rights to Published version: | Open Access |
| Description: | Original version, July 2001; this revision, January 2002 |
| References: | 1. C.G. Bird, On cost allocation for a spanning tree : A game theoretic approach, Networks 6 (1976), 335-350. 2. M. Davis and M. Maschler, The core of a cooperative game, Naval Research Logistics Quarterly 12 (1965), 223-259. 3. V. Feltkamp, “Cooperation in controlled network structures", Ph.D. thesis, NWO, Netherlands, 1995. 4. R. L. Graham and P. Hell, On the history of the minimum spanning tree problem, Annals of the History of Computing 7 (1985), 43-57. 5. D. Granot and F.Granot, On computational complexity of a cost allocation approach to a …xed cost spanning forest problem, Mathematics of Operations Research 17 (1993), 765-780. 6. D. Granot and G. Huberman, Minimum cost spanning tree games, Mathematical Programing 21 (1981), 1-18. 7. D. Granot and G. Huberman, On the core and Nucleolus of the minimum cost spanning tree games, Mathematical Programing 29 (1984), 323-347. 8. S. Hart and A. Mas-Colell, Potential, value and consistency, Econometrica 57 (1989), 589-614. 9. A. Kar, Axiomatization of the Shapley value on minimum cost spanning tree games, to appear in Games and Economic Behavior, 2000. 10. H. Moulin, Axiomatic cost and surplus-sharing, in “Handbook of Social Choice and Welfare" (K.J. Arrow, A.K. Sen, K. Suzumura, Eds.), North-Holland, 1999. 11. B. Peleg,On the reduced game property and its converse, International Journal of Game Theory 15 (1986), 187-200. 12. R. C. Prim, Shortest connection networks and some generalizations, Bell Systems Technology Journal 36 (1957), 1389-1401. 13. W. W. Sharkey, Network models in economics, in “Handbooks in Operation Research and Management Science" (M. O. Ball et al. Eds.), Elsevier Science, 1995. 14. W. Thomson, Consistency and its converse, University of Rochester, Mimeo, (1998). 15. H. P. Young, Cost allocation, in “Handbook of Game Theory with Economic Applications" (R. Aumann, S. Hart, Eds.), North Holland, 1994. |
| URI: | http://wrap.warwick.ac.uk/id/eprint/1561 |
Actions (login required)
 |
View Item |
