Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
In the context of minimum cost spanning tree problems, we present a bargaining mechanism for connecting all agents to the source and dividing the cost among them. The basic idea is very simple: we ask each agent the part of the cost he is willing to pay for an arc to be constructed. We prove that there exists a unique payoff allocation associated with the subgame perfect Nash equilibria of this bargaining mechanism. Moreover, this payoff allocation coincides with the rule defined in Bergantiños and Vidal-Puga [Bergantiños, G., Vidal-Puga, J.J., 2007a. A fair rule in minimum cost spanning tree problems. Journal of Economic Theory 137, 326-352].
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.:
- 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, 04.
- 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.
- 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.
- Vidal-Puga, Juan & Bergantinos, Gustavo, 2003. "An implementation of the Owen value," Games and Economic Behavior, Elsevier, vol. 44(2), pages 412-427, August.
- 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.
- 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).
- 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.
- 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.
- Bhaskar Dutta & Anirban Kar, 2002. "Cost monotonicity, consistency and minimum cost spanning tree games," Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers 02-04, Indian Statistical Institute, New Delhi, India.
- 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.
- 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.
- 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, 07.
- repec:spr:compst:v:59:y:2004:i:3:p:393-403 is not listed on IDEAS
- Nash, John, 1953. "Two-Person Cooperative Games," Econometrica, Econometric Society, vol. 21(1), pages 128-140, April.
- 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.
- 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.
- MUTUSWAMI, Suresh & WINTER, Eyal, 2000.
"Subscription mechanisms for network formation,"
CORE Discussion Papers
2000020, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
- Ju, Y. & Wettstein, D., 2006.
"Implementing Cooperative Solution Concepts : A Generalized Bidding Approach,"
2006-42, Tilburg University, Center for Economic Research.
- 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.
- 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.
- 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.
- 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.
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.
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.