IDEAS home Printed from https://ideas.repec.org/r/eee/gamebe/v69y2010i2p238-248.html
   My bibliography  Save this item

Sharing a minimal cost spanning tree: Beyond the Folk solution

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Christian Trudeau, 2014. "Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(4), pages 941-957, April.
  2. Dutta, Bhaskar & Mishra, Debasis, 2012. "Minimum cost arborescences," Games and Economic Behavior, Elsevier, vol. 74(1), pages 120-143.
  3. Norde, Henk, 2019. "The degree and cost adjusted folk solution for minimum cost spanning tree games," Games and Economic Behavior, Elsevier, vol. 113(C), pages 734-742.
  4. Eric Bahel & Christian Trudeau, 2017. "Minimum incoming cost rules for arborescences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 287-314, August.
  5. Christian Trudeau, 2023. "Minimum cost spanning tree problems as value sharing problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 253-272, March.
  6. G. Bergantiños & J. Vidal-Puga, 2020. "One-way and two-way cost allocation in hub network problems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 199-234, March.
  7. Hougaard, Jens Leth & Tvede, Mich, 2015. "Minimum cost connection networks: Truth-telling and implementation," Journal of Economic Theory, Elsevier, vol. 157(C), pages 76-99.
  8. Christian Trudeau, 2014. "Linking the Kar and folk solutions through a problem separation property," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(4), pages 845-870, November.
  9. Hernández, Penélope & Peris, Josep E. & Vidal-Puga, Juan, 2023. "A non-cooperative approach to the folk rule in minimum cost spanning tree problems," European Journal of Operational Research, Elsevier, vol. 307(2), pages 922-928.
  10. Trudeau, Christian & Vidal-Puga, Juan, 2020. "Clique games: A family of games with coincidence between the nucleolus and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 8-14.
  11. Trudeau, Christian & Vidal-Puga, Juan, 2017. "On the set of extreme core allocations for minimal cost spanning tree problems," Journal of Economic Theory, Elsevier, vol. 169(C), pages 425-452.
  12. Moulin, Hervé & Velez, Rodrigo A., 2013. "The price of imperfect competition for a spanning network," Games and Economic Behavior, Elsevier, vol. 81(C), pages 11-26.
  13. Andreas Darmann & Christian Klamler & Ulrich Pferschy, 2015. "Sharing the Cost of a Path," Studies in Microeconomics, , vol. 3(1), pages 1-12, June.
  14. Chun, Youngsub & Lee, Joosung, 2012. "Sequential contributions rules for minimum cost spanning tree problems," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 136-143.
  15. Hougaard, Jens Leth & Tvede, Mich, 2012. "Truth-telling and Nash equilibria in minimum cost spanning tree models," European Journal of Operational Research, Elsevier, vol. 222(3), pages 566-570.
  16. Andreas Darmann & Christian Klamler & Ulrich Pferschy, 2011. "Finding socially best spanning trees," Theory and Decision, Springer, vol. 70(4), pages 511-527, April.
  17. Jens Hougaard & Hervé Moulin & Lars Østerdal, 2010. "Decentralized pricing in minimum cost spanning trees," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 44(2), pages 293-306, August.
  18. Kusunoki, Yoshifumi & Tanino, Tetsuzo, 2017. "Investigation on irreducible cost vectors in minimum cost arborescence problems," European Journal of Operational Research, Elsevier, vol. 261(1), pages 214-221.
  19. M. A. Hinojosa & A. Caro, 2021. "A non-cooperative game theory approach to cost sharing in networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(2), pages 219-251, October.
  20. Hougaard, Jens Leth & Tvede, Mich, 2022. "Trouble comes in threes: Core stability in minimum cost connection networks," European Journal of Operational Research, Elsevier, vol. 297(1), pages 319-324.
  21. Andreas Darmann & Christian Klamler, 2014. "Knapsack cost sharing," Review of Economic Design, Springer;Society for Economic Design, vol. 18(3), pages 219-241, September.
  22. María Gómez-Rúa & Juan Vidal-Puga, 2017. "A monotonic and merge-proof rule in minimum cost spanning tree situations," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(3), pages 813-826, March.
  23. Hernández, Penélope & Peris, Josep E. & Silva-Reus, José A., 2016. "Strategic sharing of a costly network," Journal of Mathematical Economics, Elsevier, vol. 66(C), pages 72-82.
  24. Bergantiños, Gustavo & Martínez, Ricardo, 2014. "Cost allocation in asymmetric trees," European Journal of Operational Research, Elsevier, vol. 237(3), pages 975-987.
  25. Eric Bahel & Christian Trudeau, 2016. "From spanning trees to arborescences: new and extended cost sharing solutions," Working Papers 1601, University of Windsor, Department of Economics.
  26. Moulin, Hervé, 2014. "Pricing traffic in a spanning network," Games and Economic Behavior, Elsevier, vol. 86(C), pages 475-490.
  27. Trudeau, Christian, 2012. "A new stable and more responsive cost sharing solution for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, vol. 75(1), pages 402-412.
  28. Gustavo Bergantiños & María Gómez-Rúa, 2015. "An axiomatic approach in minimum cost spanning tree problems with groups," Annals of Operations Research, Springer, vol. 225(1), pages 45-63, February.
  29. Jens Leth Hougaard & Mich Tvede, 2010. "Strategyproof Nash Equilibria in Minimum Cost Spanning Tree Models," MSAP Working Paper Series 01_2010, University of Copenhagen, Department of Food and Resource Economics.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.