Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Vidal-Puga, Juan & Bergantinos, Gustavo, 2003. "An implementation of the Owen value," Games and Economic Behavior, Elsevier, vol. 44(2), pages 412-427, August.
- Nash, John, 1953. "Two-Person Cooperative Games," Econometrica, Econometric Society, vol. 21(1), pages 128-140, April.
- Gustavo Bergantiños & Leticia Lorenzo, 2004. "A non-cooperative approach to the cost spanning tree problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(3), pages 393-403, July.
- 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.
- Bergantiños, Gustavo & Vidal-Puga, Juan, 2009. "Additivity in minimum cost spanning tree problems," Journal of Mathematical Economics, Elsevier, vol. 45(1-2), pages 38-42, January.
- 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.
- 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.
- Stefano Moretti & Rodica Branzei & Henk Norde & Stef Tijs, 2004.
"The P-value for cost sharing in minimum,"
Theory and Decision, Springer, vol. 56(1), pages 47-61, April.
- Stefano Moretti & Rodica Branzei & Henk Norde & Stef Tijs, 2004. "The P-value for cost sharing in minimum," Theory and Decision, Springer, vol. 56(2_2), pages 47-61, February.
- Dutta, Bhaskar & Kar, Anirban, 2004.
"Cost monotonicity, consistency and minimum cost spanning tree games,"
Games and Economic Behavior, Elsevier, vol. 48(2), pages 223-248, August.
- Dutta, Bhaskar & Kar, Anirban, 2002. "Cost Monotonicity, Consistency And Minimum Cost Spanning Tree Games," The Warwick Economics Research Paper Series (TWERPS) 629, University of Warwick, Department of Economics.
- Bhaskar Dutta & Anirban Kar, 2002. "Cost monotonicity, consistency and minimum cost spanning tree games," Discussion Papers 02-04, Indian Statistical Institute, Delhi.
- Dutta, Bhaskar & Kar, Anirban, 2002. "Cost Monotonicity, Consistency and Minimum Cost Spanning Tree Games," Economic Research Papers 269403, University of Warwick - Department of Economics.
- Perez-Castrillo, David & Wettstein, David, 2001.
"Bidding for the Surplus : A Non-cooperative Approach to the Shapley Value,"
Journal of Economic Theory, Elsevier, vol. 100(2), pages 274-294, October.
- David Pérez-Castrillo & David Wettstein, "undated". "Bidding For The Surplus: A Non-Cooperative Approach To The Shapley Value," UFAE and IAE Working Papers 461.00, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
- Yuan Ju & David Wettstein, 2009.
"Implementing cooperative solution concepts: a generalized bidding approach,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 39(2), pages 307-330, May.
- Ju, Y. & Wettstein, D., 2006. "Implementing Cooperative Solution Concepts : A Generalized Bidding Approach," Discussion Paper 2006-42, Tilburg University, Center for Economic Research.
- Yuan Ju & David Wettstein, 2006. "Implementing Cooperative Solution Concepts: a Generalized Bidding Approach," Keele Economics Research Papers KERP 2006/06, Centre for Economic Research, Keele University.
- Ju, Y. & Wettstein, D., 2006. "Implementing Cooperative Solution Concepts : A Generalized Bidding Approach," Other publications TiSEM a0415c9e-d51e-4c93-8872-8, 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.
- Brânzei, R. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2003.
"The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations,"
Discussion Paper
2003-129, Tilburg University, Center for Economic Research.
- Brânzei, R. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2004. "The P-value for cost sharing in minimum cost spanning tree situations," Other publications TiSEM b41d77ef-69cb-4ffa-8309-d, Tilburg University, School of Economics and Management.
- 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.
- Gustavo Bergantiños & Leticia Lorenzo, 2005. "Optimal Equilibria in the Non-Cooperative Game Associated with Cost Spanning Tree Problems," Annals of Operations Research, Springer, vol. 137(1), pages 101-115, July.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Jens Leth Hougaard & Mich Tvede, 2020. "Implementation of Optimal Connection Networks," IFRO Working Paper 2020/06, University of Copenhagen, Department of Food and Resource Economics.
- 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.
- Jens Leth Hougaard & Mich Tvede, 2013. "Minimum Cost Connection Networks: Truth-telling and Implementation," MSAP Working Paper Series 03_2013, University of Copenhagen, Department of Food and Resource Economics.
- 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.
- Jens Leth Hougaard & Mich Tvede, 2020. "Trouble Comes in Threes: Core stability in Minimum Cost Connection Networks," IFRO Working Paper 2020/07, University of Copenhagen, Department of Food and Resource Economics.
- Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
- Bergantiños, Gustavo & Groba, Carlos & Sartal, Antonio, 2023. "Applying the Shapley value to the tuna fishery," European Journal of Operational Research, Elsevier, vol. 309(1), pages 306-318.
- 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.
- Pérez-Castrillo, David & Quérou, Nicolas, 2012.
"Smooth multibidding mechanisms,"
Games and Economic Behavior, Elsevier, vol. 76(2), pages 420-438.
- David Pérez-Castrillo & Nicolas Quérou, 2010. "Smooth multibidding mechanisms," UFAE and IAE Working Papers 849.10, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Nicolas Quérou & David Pérez-Castrillo, 2015. "Smooth Multibidding Mechanisms," Working Papers 520, Barcelona School of Economics.
- David Pérez-Castrillo & Nicolas Quérou, 2011. "Smooth Multibidding Mechanisms," CESifo Working Paper Series 3394, CESifo.
- 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.
- Hernández, Penélope & Josep E., Peris & Vidal-Puga, Juan, 2019. "A Non-Cooperative Approach to the Folk Rule in Minimum Cost Spanning Tree Problems," QM&ET Working Papers 19-5, University of Alicante, D. Quantitative Methods and Economic Theory.
- Gustavo Bergantiños & Juan Vidal-Puga, 2015.
"Characterization of monotonic rules in minimum cost spanning tree problems,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 44(4), pages 835-868, November.
- Bergantiños, Gustavo & Vidal-Puga, Juan, 2012. "Characterization of monotonic rules in minimum cost spanning tree problems," MPRA Paper 39994, University Library of Munich, Germany.
- 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.
- Rosenthal, Edward C., 2017. "A cooperative game approach to cost allocation in a rapid-transit network," Transportation Research Part B: Methodological, Elsevier, vol. 97(C), pages 64-77.
- Li, Deng-Feng, 2012. "A fast approach to compute fuzzy values of matrix games with payoffs of triangular fuzzy numbers," European Journal of Operational Research, Elsevier, vol. 223(2), pages 421-429.
- Rosenthal, Edward C., 2013. "Shortest path games," European Journal of Operational Research, Elsevier, vol. 224(1), pages 132-140.
- 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.
- 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.
- Bergantiños, Gustavo & Martínez, Ricardo, 2014. "Cost allocation in asymmetric trees," European Journal of Operational Research, Elsevier, vol. 237(3), pages 975-987.
- 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, 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.
- 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.
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 & María Gómez-Rúa, 2010. "Minimum cost spanning tree problems with groups," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 43(2), pages 227-262, May.
- 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.
- 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.
- Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
- 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.
- 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, 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.
- Bergantiños, Gustavo & Kar, Anirban, 2010. "On obligation rules for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, vol. 69(2), pages 224-237, July.
- 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.
- Bergantiños, Gustavo & Vidal-Puga, Juan, 2009. "Additivity in minimum cost spanning tree problems," Journal of Mathematical Economics, Elsevier, vol. 45(1-2), pages 38-42, January.
- Bergantiños, Gustavo & Lorenzo, Leticia & Lorenzo-Freire, Silvia, 2011. "A generalization of obligation rules for minimum cost spanning tree problems," European Journal of Operational Research, Elsevier, vol. 211(1), pages 122-129, May.
- 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.
- Bergantinos, Gustavo & Lorenzo-Freire, Silvia, 2008. ""Optimistic" weighted Shapley rules in minimum cost spanning tree problems," European Journal of Operational Research, Elsevier, vol. 185(1), pages 289-298, February.
- 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.
- Gomez-Rua, Maria & Vidal-Puga, Juan, 2006. "No advantageous merging in minimum cost spanning tree problems," MPRA Paper 601, University Library of Munich, Germany.
- Gustavo Bergantiños & Juan Vidal-Puga, 2015.
"Characterization of monotonic rules in minimum cost spanning tree problems,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 44(4), pages 835-868, November.
- Bergantiños, Gustavo & Vidal-Puga, Juan, 2012. "Characterization of monotonic rules in minimum cost spanning tree problems," MPRA Paper 39994, University Library of Munich, Germany.
- Gustavo Bergantiños & Juan Vidal-Puga, 2004. "Realizing efficient outcomes in cost spanning problems," Game Theory and Information 0403001, University Library of Munich, Germany.
- Gustavo Bergantiños & Leticia Lorenzo, 2021.
"Cost additive rules in minimum cost spanning tree problems with multiple sources,"
Annals of Operations Research, Springer, vol. 301(1), pages 5-15, June.
- Bergantiños, Gustavo & Lorenzo, Leticia, 2019. "Cost additive rules in minimum cost spanning tree problems with multiple sources," MPRA Paper 96937, University Library of Munich, Germany.
- 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.
- Davila-Pena, Laura & Borm, Peter & Garcia-Jurado, Ignacio & Schouten, Jop, 2023.
"An Allocation Rule for Graph Machine Scheduling Problems,"
Discussion Paper
2023-009, Tilburg University, Center for Economic Research.
- Davila-Pena, Laura & Borm, Peter & Garcia-Jurado, Ignacio & Schouten, Jop, 2023. "An Allocation Rule for Graph Machine Scheduling Problems," Other publications TiSEM 17013f33-1d65-4294-802c-b, Tilburg University, School of Economics and Management.
More about this item
Keywords
Minimum cost spanning tree problems Implementation;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:eee:ejores:v:201:y:2010:i:3:p:811-820. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.