Skip to main content
SpringerLink
Log in

The Bird Core for Minimum Cost Spanning Tree Problems Revisited: Monotonicity and Additivity Aspects

  • Conference paper
Book cover Recent Advances in Optimization

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 563))

Summary

A new way is presented to define for minimum cost spanning tree (mcst) games the irreducible core, which is introduced by Bird in 1976. The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost monotonic allocation rule for mcst-problems is a selection of the Bird core correspondence. Using the additivity property an axiomatic characterization of the Bird core correspondence is obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Aarts. Minimum cost spanning tree games and set games. PhD Dissertation, Univ. of Twente, The Netherlands, 1994.

    Google Scholar 

  2. G. Bergañtinos and J.J. Vidal-Puga. Defining rules in cost spanning tree problems through the canonical form. EconPapers (RePEc:wpa:wuwpga 0402004), 2004.

    Google Scholar 

  3. C.G. Bird. On cost allocation for a spanning tree: a game theoretic approach. Networks 6:335–350, 1976.

    MATH  MathSciNet  Google Scholar 

  4. R. Branzei, S. Moretti, H. Norde, and S. Tijs. The P-value for cost sharing in minimum cost spanning tree situations. Theory and Decision 56:47–61, 2004.

    Article  MathSciNet  Google Scholar 

  5. R. Branzei, T. Solymosi, and S. Tijs. Type monotonic allocation schemes for multi-glove games. CentER DP 2002-117, Tilburg Univ., The Netherlands, 2002.

    Google Scholar 

  6. R. Branzei and S. Tijs. Additivity regions for solutions in cooperative game theory. Libertas Mathematics 21:155–167, 2001.

    MathSciNet  Google Scholar 

  7. R. Branzei, S. Tijs, and J. Timmer. Information collecting situations and bimonotonic allocation schemes. Math. Meth. Oper. Res., 54:303–313, 2001.

    Article  MathSciNet  Google Scholar 

  8. A. Claus and D.J. Kleitman. Cost allocation for a spanning tree. Networks 3:289–304, 1973.

    MathSciNet  Google Scholar 

  9. I. Dragan, J. Potters, and S. Tijs. Superadditivity for solutions of coalitional games. Libertas Mathematics 9:101–110, 1989.

    MathSciNet  Google Scholar 

  10. B. Dutta and A. Kar. Cost monotonicity, consistency and minimum cost spanning tree games. Games and Economic Behavior, 48:223–248, 2004.

    Article  MathSciNet  Google Scholar 

  11. V. Feltkamp. Cooperation in controlled network structures. PhD Dissertation, Tilburg Univ., The Netherlands, 1995.

    Google Scholar 

  12. V. Feltkamp, S. Tijs, and S. Muto. On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems. CentER DP 1994 nr.106, Tilburg Univ., The Netherlands, 1994.

    Google Scholar 

  13. D. Granot and A. Claus. Game theory application to cost allocation for a spanning tree. Working Paper 402, Fac. of Commerce and Business Administration, Univ. of British Columbia, 1976.

    Google Scholar 

  14. D. Granot and G. Huberman. On minimum cost spanning tree games. Mathematical Programming 21:1–18, 1981.

    Article  MathSciNet  Google Scholar 

  15. T. Ichiishi. Super-modularity: applications to convex games and the greedy algorithm for LP. Journal of Economic Theory 25:283–286, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  16. J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7:48–50, 1956.

    Article  MATH  MathSciNet  Google Scholar 

  17. S. Moretti, H. Norde, K.H. Pham Do, and S. Tijs. Connection problems in mountains and monotonic allocation schemes. Top 10:83–99, 2002.

    MathSciNet  Google Scholar 

  18. S. Moretti, S. Tijs, R. Branzei, H. Norde. Cost monotonic’ construct and charge’ rules for connection situations. Working Paper, 2005.

    Google Scholar 

  19. H. Norde, S. Moretti, and S. Tijs. Minimum cost spanning tree games and population monotonic allocation schemes. European J. Oper. Res. 154:84–97, 2004.

    Article  MathSciNet  Google Scholar 

  20. R.C. Prim. Shortest connection networks and some generalizations. Bell Systems Technical Journal 36:1389–1401, 1957.

    Google Scholar 

  21. Y. Sprumont. Population monotonic allocation schemes for cooperative games with transferable utility. Games and Economic Behavior 2:378–394, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  22. S. Tijs and R. Branzei. Additive stable solutions on perfect cones of cooperative games. Int. J. Game Theory 31:469–474, 2002.

    Article  MathSciNet  Google Scholar 

  23. S. Tijs, R. Branzei, S. Moretti and H. Norde. Obligation rules for minimum cost spanning tree situations and their monotonicity properties. CentER DP 2004-53, Tilburg Univ., The Netherlands, 2004 (to appear in European J. Oper. Res.).

    Google Scholar 

  24. M. Voorneveld, S. Tijs, and S. Grahn. Monotonic allocation schemes in clan games. Math. Meth. Oper. Res., 56:439–449, 2002.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Genoa, Italy

    Stef Tijs & Stefano Moretti

  2. CentER and Department of Econometrics and Operations Research, Tilburg University, The Netherlands

    Stef Tijs & Henk Norde

  3. Unit of Molecular Epidemiology, National Cancer Research Institute of Genoa, Italy

    Stefano Moretti

  4. Faculty of Computer Science, “Alexandru Ioan Cuza” University, Iasi, Romania

    Rodica Branzei

Authors
  1. Stef Tijs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Moretti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rodica Branzei
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Henk Norde
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Avignon, 33, rue Louis Pasteur, 84000, Avignon, France

    Alberto Seeger

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tijs, S., Moretti, S., Branzei, R., Norde, H. (2006). The Bird Core for Minimum Cost Spanning Tree Problems Revisited: Monotonicity and Additivity Aspects. In: Seeger, A. (eds) Recent Advances in Optimization. Lecture Notes in Economics and Mathematical Systems, vol 563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28258-0_19

Download citation

Publish with us

Policies and ethics

Search

Navigation