IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this article or follow this journal

A new stable and more responsive cost sharing solution for minimum cost spanning tree problems

  • Trudeau, Christian

Minimum cost spanning tree (mcst) problems try to connect agents efficiently to a source when agents are located at different points in space and the cost of using an edge is fixed. We introduce a new cost sharing solution that always selects a point in the core and that is more responsive to changes than the well-studied folk solution. The paper shows a sufficient condition for the concavity of the stand-alone cost game. Modifying the game to make sure the condition is satisfied and then taking the Shapley value gives the new solution.

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.

File URL: http://www.sciencedirect.com/science/article/pii/S0899825611001497
Download Restriction: Full text for ScienceDirect subscribers only

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.

Article provided by Elsevier in its journal Games and Economic Behavior.

Volume (Year): 75 (2012)
Issue (Month): 1 ()
Pages: 402-412

as
in new window

Handle: RePEc:eee:gamebe:v:75:y:2012:i:1:p:402-412
Contact details of provider: Web page: http://www.elsevier.com/locate/inca/622836

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.:

as in new window
  1. 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.
  2. Christian Trudeau, 2014. "Linking the Kar and folk solutions through a problem separation property," International Journal of Game Theory, Springer, vol. 43(4), pages 845-870, November.
  3. 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.
  4. 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.
  5. van den Nouweland, Anne & Borm, Peter, 1991. "On the Convexity of Communication Games," International Journal of Game Theory, Springer, vol. 19(4), pages 421-30.
  6. 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.
  7. van den Nouweland, C.G.A.M. & Borm, P.E.M., 1991. "On the convexity of communication games," Other publications TiSEM e754cb6a-f695-4099-bfbf-c, Tilburg University, School of Economics and Management.
  8. 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.
  9. 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.
  10. 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.
  11. 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.
Full references (including those not matched with items on IDEAS)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:75:y:2012:i:1:p:402-412. 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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.