Truth-telling and Nash equilibria in minimum cost spanning tree models
In this paper we consider the minimum cost spanning tree model. We assume that a central planner aims at implementing a minimum cost spanning tree not knowing the true link costs. The central planner sets up a game where agents announce link costs, a tree is chosen and costs are allocated according to the rules of the game. We characterize ways of allocating costs such that true announcements constitute Nash equilibria both in case of full and incomplete information. In particular, we find that the Shapley rule based on the irreducible cost matrix is consistent with truthful announcements while a series of other well-known rules (such as the Bird-rule, Serial Equal Split, and the Proportional rule) are not.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Green, Jerry & Laffont, Jean-Jacques, 1977. "Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods," Econometrica, Econometric Society, vol. 45(2), pages 427-38, March.
- Peyton Young, H., 1998. "Cost allocation, demand revelation, and core implementation," Mathematical Social Sciences, Elsevier, vol. 36(3), pages 213-228, December.
- Schmeidler David & Tauman Yair, 1994. "Incentive-Compatible Cost-Allocation Schemes," Journal of Economic Theory, Elsevier, vol. 63(2), pages 189-207, August.
- 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.
- Tijs, S.H. & Brânzei, R. & Moretti, S. & Norde, H.W., 2004.
"Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties,"
2004-53, Tilburg University, Center for Economic Research.
- Tijs, Stef & Branzei, Rodica & Moretti, Stefano & Norde, Henk, 2006. "Obligation rules for minimum cost spanning tree situations and their monotonicity properties," European Journal of Operational Research, Elsevier, vol. 175(1), pages 121-134, November.
- Maskin, Eric, 1999.
"Nash Equilibrium and Welfare Optimality,"
Review of Economic Studies,
Wiley Blackwell, vol. 66(1), pages 23-38, January.
- Eric Maskin, 1998. "Nash Equilibrium and Welfare Optimality," Harvard Institute of Economic Research Working Papers 1829, Harvard - Institute of Economic Research.
- Jens Leth Hougaard & Hervé Moulin & Lars Peter Østerdal, 2008.
"Decentralized Pricing in Minimum Cost Spanning Trees,"
08-24, University of Copenhagen. Department of Economics.
- Jens Hougaard & Hervé Moulin & Lars Østerdal, 2010. "Decentralized pricing in minimum cost spanning trees," Economic Theory, Springer, vol. 44(2), pages 293-306, August.
- Sanjeev Goyal, 2007.
"Introduction to Connections: An Introduction to the Economics of Networks
[Connections: An Introduction to the Economics of Networks]," Introductory Chapters, Princeton University Press.
- 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.
- Jackson, Matthew O, 1991. "Bayesian Implementation," Econometrica, Econometric Society, vol. 59(2), pages 461-77, March.
- 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.
- Hervé Moulin & Scott Shenker, 2001. "Strategyproof sharing of submodular costs:budget balance versus efficiency," Economic Theory, Springer, vol. 18(3), pages 511-533.
- 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, EconWPA.
- Ruben Juarez & Rajnish Kumar, 2012.
"Implementing Efficient Graphs in Connection Networks,"
201203, University of Hawaii at Manoa, Department of Economics.
- Ruben Juarez & Rajnish Kumar, 2013. "Implementing efficient graphs in connection networks," Economic Theory, Springer, vol. 54(2), pages 359-403, October.
- Rajnish Kumar & Ruben Juarez, . "Implementing Efficient Graphs in Connection Networks," Departmental Working Papers 2011-03, Department of Economics, Louisiana State University.
- Ruben Juarez & Rajnish Kumar, 2010. "Implementing Efficient Graphs in Connection Networks," Working Papers 201022, University of Hawaii at Manoa, Department of Economics.
- Dasgupta, Partha S & Hammond, Peter J & Maskin, Eric S, 1979. "The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility," Review of Economic Studies, Wiley Blackwell, vol. 46(2), pages 185-216, April.
- María Gómez-Rúa & Juan Vidal-Puga, 2011. "Merge-proofness in minimum cost spanning tree problems," International Journal of Game Theory, Springer, vol. 40(2), pages 309-329, May.
- 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.
- 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.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:222:y:2012:i:3:p:566-570. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.