The price of imperfect competition for a spanning network
A buyer procures a network to span a given set of nodes; each seller bids to supply certain edges, then the buyer purchases a minimal cost spanning tree. An efficient tree is constructed in any equilibrium of the Bertrand game.
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.:
- Drew Fudenberg & David Levine, 2008.
"Limit Games and Limit Equilibria,"
World Scientific Book Chapters,in: A Long-Run Collaboration On Long-Run Games, chapter 2, pages 21-39
World Scientific Publishing Co. Pte. Ltd..
- Fudenberg, Drew & Levine, David, 1986. "Limit games and limit equilibria," Journal of Economic Theory, Elsevier, vol. 38(2), pages 261-279, April.
- Drew Fudenberg & David Levine, 1983. "Limit Games and Limit Equilibria," UCLA Economics Working Papers 289, UCLA Department of Economics.
- Drew Fudenberg & David K. Levine, 1986. "Limit Games and Limit Equilibria," Levine's Working Paper Archive 220, David K. Levine.
- Fudenberg, Drew & Levine, David, 1986. "Limit Games and Limit Equilibria," Scholarly Articles 3350443, Harvard University Department of Economics.
- Simon, Leo K & Zame, William R, 1990. "Discontinuous Games and Endogenous Sharing Rules," Econometrica, Econometric Society, vol. 58(4), pages 861-872, July.
- Leo K. Simon and William R. Zame., 1987. "Discontinuous Games and Endogenous Sharing Rules," Economics Working Papers 8756, University of California at Berkeley.
- Simon, Leo K. & Zame, William R., 1987. "Discontinous Games and Endogenous Sharing Rules," Department of Economics, Working Paper Series qt8n46v2wv, Department of Economics, Institute for Business and Economic Research, UC Berkeley.
- 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.
- Tilman Börgers, 1992. "Iterated Elimination of Dominated Strategies in a Bertrand-Edgeworth Model," Review of Economic Studies, Oxford University Press, vol. 59(1), pages 163-176.
- 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, EconWPA.
- 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.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:81:y:2013:i:c:p:11-26. 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: (Dana Niculescu)
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.