From spanning trees to arborescences: new and extended cost sharing solutions
Download full text from publisher
References listed on IDEAS
- 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.
- 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.
- 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.
- 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.
- 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.
- Tijs, S.H. & Brânzei, R. & Moretti, S. & Norde, H.W., 2004. "Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties," Discussion Paper 2004-53, Tilburg University, Center for Economic Research.
- Eric Bahel, 2016. "On the core and bargaining set of a veto game," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(3), pages 543-566, August.
- Bahel, Eric & Trudeau, Christian, 2014.
"Stable lexicographic rules for shortest path games,"
Elsevier, vol. 125(2), pages 266-269.
- Eric Bahel & Christian Trudeau, 2014. "Stable lexicographic rules for shortest path games," Working Papers e07-46, Virginia Polytechnic Institute and State University, Department of Economics.
- Dutta, Bhaskar & Mishra, Debasis, 2012.
"Minimum cost arborescences,"
Games and Economic Behavior,
Elsevier, vol. 74(1), pages 120-143.
- Bhaskar Dutta & Debasis Mishra, 2008. "Minimum cost arborescences," Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers 08-12, Indian Statistical Institute, New Delhi, India.
- Dutta, Bhaskar & Mishra, Debasis, 2009. "Minimum Cost Arborescences," The Warwick Economics Research Paper Series (TWERPS) 889, University of Warwick, Department of Economics.
More about this item
Keywordsarborescence problems; stable allocations; minimal incoming cost rules; leftover cost matrix;
- 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:
- NEP-ALL-2016-01-18 (All new papers)
- NEP-ALL-2016-01-29 (All new papers)
- NEP-CMP-2016-01-18 (Computational Economics)
- NEP-GTH-2016-01-18 (Game Theory)
- NEP-GTH-2016-01-29 (Game Theory)
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:1601. 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.