Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
Download full text from publisher
Other versions of this item:
- Christian Trudeau, 2014. "Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(4), pages 941-957, April.
References listed on IDEAS
- 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.
- repec:wsi:igtrxx:v:15:y:2013:i:02:n:s0219198913400033 is not listed on IDEAS
- 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.
- 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.
- Trudeau, Christian, 2012. "A new stable and more responsive cost sharing solution for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, vol. 75(1), pages 402-412.
- 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.
- 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.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Kusunoki, Yoshifumi & Tanino, Tetsuzo, 2017. "Investigation on irreducible cost vectors in minimum cost arborescence problems," European Journal of Operational Research, Elsevier, vol. 261(1), pages 214-221.
- 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.
More about this item
KeywordsMinimum cost spanning tree problems; folk solution; cycle-complete solution; core.;
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
NEP fieldsThis paper has been announced in the following NEP Reports:
StatisticsAccess and download statistics
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:wis:wpaper:1303. 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: (Christian Trudeau). General contact details of provider: http://edirc.repec.org/data/dwindca.html .
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 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.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.