Connection Situations under Uncertainty
作者： Stefano Moretti , Sirma Zeynep Alparslan-Gok , Rodica Branzei , Stef H. Tijs
DOI: 10.2139/SSRN.1262162
关键词:
摘要: This paper deals with cost allocation problems arising from connection situations where edge costs are closed intervals of real numbers. To solve such problems, we extend classical solutions the theory minimum spanning tree games. We study properties and suggest how to use them under uncertainty conditions.
core.ac.uk
dauphine.fr 参考文章(21)
Sirma Zeynep Alparslan-Gok, Rodica Branzei, Stef H. Tijs, Cooperative Interval Games Arising from Airport Situations with Interval Data Social Science Research Network. ,(2008) , 10.2139/SSRN.1150185
D.A. Dimitrov, S.H. Tijs, R. Brânzei, Shapley-like values for interval bankruptcy games Economics Bulletin. ,vol. 3, pp. 1- 8 ,(2003)
Robert J Aumann, Michael Maschler, Game theoretic analysis of a bankruptcy problem from the Talmud Journal of Economic Theory. ,vol. 36, pp. 195- 213 ,(1985) , 10.1016/0022-0531(85)90102-4
C. G. Bird, On cost allocation for a spanning tree: A game theoretic approach Networks. ,vol. 6, pp. 335- 350 ,(1976) , 10.1002/NET.3230060404
Gustavo Bergantiños, Juan J. Vidal-Puga, A fair rule in minimum cost spanning tree problems Journal of Economic Theory. ,vol. 137, pp. 326- 352 ,(2007) , 10.1016/J.JET.2006.11.001
Abraham Wald, Statistical decision functions ,(1950)
Sirma Zeynep Alparslan-Gok, Sylvia Miquel, Stef H. Tijs, Cooperation under Interval Uncertainty Social Science Research Network. ,(2008) , 10.2139/SSRN.1096056
Roberto Montemanni, A Benders decomposition approach for the robust spanning tree problem with interval data European Journal of Operational Research. ,vol. 174, pp. 1479- 1490 ,(2006) , 10.1016/J.EJOR.2005.02.060
A. Claus, D. J. Kleitman, Cost allocation for a spanning tree Networks. ,vol. 3, pp. 289- 304 ,(1973) , 10.1002/NET.3230030402
Rodica Branzei, Stefano Moretti, Henk W. Norde, Stef H. Tijs, The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations Social Science Research Network. ,(2003) , 10.2139/SSRN.556971