A Non-Cooperative Approach to the Folk Rule in Minimum Cost Spanning Tree Problems
Author
Abstract
Suggested Citation
Download full text from publisher
Other versions of this item:
- 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.
References listed on IDEAS
- 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.
- Norde, Henk & Moretti, Stefano & Tijs, Stef, 2004.
"Minimum cost spanning tree games and population monotonic allocation schemes,"
European Journal of Operational Research, Elsevier, vol. 154(1), pages 84-97, April.
- Norde, H.W. & Moretti, S. & Tijs, S.H., 2001. "Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes," Discussion Paper 2001-18, Tilburg University, Center for Economic Research.
- Norde, H.W. & Moretti, S. & Tijs, S.H., 2004. "Minimum cost spanning tree games and population monotonic allocation schemes," Other publications TiSEM bcaf99d7-5b94-437f-a89c-d, Tilburg University, School of Economics and Management.
- Roberto Serrano, 2021.
"Sixty-seven years of the Nash program: time for retirement?,"
SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(1), pages 35-48, March.
- Roberto Serrano, 2020. "Sixty-Seven Years of the Nash Program: Time for Retirement?," Working Papers 2020-20, Brown University, Department of Economics.
- Mutuswami, Suresh & Winter, Eyal, 2002.
"Subscription Mechanisms for Network Formation,"
Journal of Economic Theory, Elsevier, vol. 106(2), pages 242-264, October.
- MUTUSWAMI, Suresh & WINTER, Eyal, 2000. "Subscription mechanisms for network formation," LIDAM Discussion Papers CORE 2000020, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Suresh Mutuswami & Eyal Winter, 2001. "Subscription Mechanisms for Network Formation," Discussion Paper Series dp264, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems," Other publications TiSEM 56ea8c64-a05f-4b3f-ab61-9, Tilburg University, School of Economics and Management.
- 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.
- Hernández, Penélope & Peris, Josep E. & Silva-Reus, José A., 2012. "Strategic Sharing of a Costly Network," QM&ET Working Papers 12-10, University of Alicante, D. Quantitative Methods and Economic Theory.
- 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.
- Christian Trudeau & Juan Vidal-Puga, 2017. "Clique games: a family of games with coincidence between the nucleolus and the Shapley value," Working Papers 1705, University of Windsor, Department of Economics.
- Trudeau, Christian & Vidal-Puga, Juan, 2018. "Clique games: a family of games with coincidence between the nucleolus and the Shapley value," MPRA Paper 95999, University Library of Munich, Germany.
- Trudeau, Christian & Vidal-Puga, Juan, 2018. "Clique games: a family of games with coincidence between the nucleolus and the Shapley value," MPRA Paper 96710, University Library of Munich, Germany.
- Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems," Discussion Paper 1994-106, Tilburg University, Center for Economic Research.
- Bergantiños, Gustavo & Vidal-Puga, Juan, 2010. "Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms," European Journal of Operational Research, Elsevier, vol. 201(3), pages 811-820, March.
- 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.
- Bogomolnaia, Anna & Moulin, Hervé, 2010. "Sharing a minimal cost spanning tree: Beyond the Folk solution," Games and Economic Behavior, Elsevier, vol. 69(2), pages 238-248, July.
- Bergantinos, Gustavo & Vidal-Puga, Juan J., 2007.
"A fair rule in minimum cost spanning tree problems,"
Journal of Economic Theory, Elsevier, vol. 137(1), pages 326-352, November.
- Gustavo Bergantiños & Juan Vidal-Puga, 2005. "A fair rule in minimum cost spanning tree problems," Game Theory and Information 0504001, University Library of Munich, Germany.
- Dutta, Bhaskar & Mishra, Debasis, 2012.
"Minimum cost arborescences,"
Games and Economic Behavior, Elsevier, vol. 74(1), pages 120-143.
- Bhaskar Dutta & Debasis Mishra, 2008. "Minimum cost arborescences," Discussion Papers 08-12, Indian Statistical Institute, Delhi.
- Dutta, Bhaskar & Mishra, Debasis, 2009. "Minimum Cost Arborescences," Economic Research Papers 271310, University of Warwick - Department of Economics.
- Dutta, Bhaskar & Mishra, Debasis, 2009. "Minimum Cost Arborescences," The Warwick Economics Research Paper Series (TWERPS) 889, University of Warwick, Department of Economics.
- Gustavo Bergantinos & Juan Vidal-Puga, 2008. "On Some Properties of Cost Allocation Rules in Minimum Cost Spanning Tree Problems," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 2(3), pages 251-267, December.
- Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "Minimum cost spanning extension problems : The proportional rule and the decentralized rule," Other publications TiSEM 2c6cd46b-7e72-4262-a479-3, Tilburg University, School of Economics and Management.
- Kar, Anirban, 2002. "Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games," Games and Economic Behavior, Elsevier, vol. 38(2), pages 265-277, February.
- Bag, Parimal Kanti & Winter, Eyal, 1999. "Simple Subscription Mechanisms for Excludable Public Goods," Journal of Economic Theory, Elsevier, vol. 87(1), pages 72-94, July.
- Gustavo Bergantiños & Juan Vidal-Puga, 2007. "The optimistic TU game in minimum cost spanning tree problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(2), pages 223-239, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Gustavo Bergantiños & Juan Vidal-Puga, 2021. "A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(1), pages 73-100, March.
- Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
- 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.
- Gómez-Rúa, María & Vidal-Puga, Juan, 2015. "A monotonic and merge-proof rule in minimum cost spanning tree situations," MPRA Paper 62923, University Library of Munich, Germany.
- Dutta, Bhaskar & Mishra, Debasis, 2012.
"Minimum cost arborescences,"
Games and Economic Behavior, Elsevier, vol. 74(1), pages 120-143.
- Bhaskar Dutta & Debasis Mishra, 2008. "Minimum cost arborescences," Discussion Papers 08-12, Indian Statistical Institute, Delhi.
- Dutta, Bhaskar & Mishra, Debasis, 2009. "Minimum Cost Arborescences," The Warwick Economics Research Paper Series (TWERPS) 889, University of Warwick, Department of Economics.
- Dutta, Bhaskar & Mishra, Debasis, 2009. "Minimum Cost Arborescences," Economic Research Papers 271310, University of Warwick - Department of Economics.
- 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.
- Christian Trudeau, 2021. "Minimum cost spanning tree problems as value sharing problems," Working Papers 2101, University of Windsor, Department of Economics.
- José-Manuel Giménez-Gómez & Josep E Peris & Begoña Subiza, 2020.
"An egalitarian approach for sharing the cost of a spanning tree,"
PLOS ONE, Public Library of Science, vol. 15(7), pages 1-14, July.
- Giménez Gómez, José M. (José Manuel) & Peris, Josep E. & Subiza, Begoña, 2019. "An egalitarian approach for sharing the cost of a spanning tree," Working Papers 2072/376029, Universitat Rovira i Virgili, Department of Economics.
- Giménez-Gómez, José M & Peris, Josep E & Subiza, Begoña, 2019. "An Egalitarian Approach for Sharing the Cost of a Spanning Tree," QM&ET Working Papers 19-3, University of Alicante, D. Quantitative Methods and Economic Theory.
- 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.
- Hernández, Penélope & Peris, Josep E. & Silva-Reus, José A., 2012. "Strategic Sharing of a Costly Network," QM&ET Working Papers 12-10, University of Alicante, D. Quantitative Methods and Economic Theory.
- 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.
- Christian Trudeau, 2013. "Linking the Kar and Folk Solutions Through a Problem Separation Property," Working Papers 1301, University of Windsor, Department of Economics.
- 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.
- 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.
- Moulin, Hervé, 2014. "Pricing traffic in a spanning network," Games and Economic Behavior, Elsevier, vol. 86(C), pages 475-490.
- 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.
- Jens Leth Hougaard & Hervé Moulin & Lars Peter Østerdal, 2008. "Decentralized Pricing in Minimum Cost Spanning Trees," Discussion Papers 08-24, University of Copenhagen. Department of Economics.
- Bogomolnaia, Anna & Moulin, Hervé, 2010. "Sharing a minimal cost spanning tree: Beyond the Folk solution," Games and Economic Behavior, Elsevier, vol. 69(2), pages 238-248, July.
- 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.
- 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.
- Bergantiños, G. & Gómez-Rúa, M. & Llorca, N. & Pulido, M. & Sánchez-Soriano, J., 2014. "A new rule for source connection problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 780-788.
- 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.
- Christian Trudeau, 2013. "Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems," Working Papers 1303, University of Windsor, Department of Economics.
- Chun, Youngsub & Lee, Joosung, 2012. "Sequential contributions rules for minimum cost spanning tree problems," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 136-143.
- Bergantiños, Gustavo & Martínez, Ricardo, 2014. "Cost allocation in asymmetric trees," European Journal of Operational Research, Elsevier, vol. 237(3), pages 975-987.
- 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.
More about this item
Keywords
Minimum cost spanning tree; cost allocation; subgame perfect equilibrium;All these keywords.
JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
NEP fields
This paper has been announced in the following NEP Reports:- NEP-GTH-2019-11-18 (Game Theory)
- NEP-ORE-2019-11-18 (Operations Research)
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ris:qmetal:2019_005. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Julio Carmona (email available below). General contact details of provider: https://edirc.repec.org/data/dmalies.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.