DocumentCode
536745
Title
The Interval Core of the Minimum Cost Spanning Tree Interval Game and Its Calculation
Author
Liu, Xiaodong ; Lei, Fumin
Author_Institution
Sch. of Manage. Eng., Xi´´an Univ. of Finance & Econ., Xi´´an, China
fYear
2010
fDate
7-9 Nov. 2010
Firstpage
1
Lastpage
4
Abstract
In this paper, the minimal cost spanning tree interval game is studied. It is proved that the interval core is no empty when n=2. By introducing the concepts of the left game, right game of MCSTIG, and compositive, it is proved there exists a hyperplane with non-negative normal vector to separate L and R strictly. when the interval core of MCSTIG is empty. It obtained the sufficient and necessary condition of no empty interval core of MCSTIG, by using linear programming tools. Finally, the algorithm to calculate the interval core of MCSTIG is presented.
Keywords
game theory; linear programming; trees (mathematics); MCSTIG; hyperplane; linear programming tools; minimum cost spanning tree interval game; nonnegative normal vector; Birds; Economics; Games; Linear programming; Programming; Resource management; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
E-Product E-Service and E-Entertainment (ICEEE), 2010 International Conference on
Conference_Location
Henan
Print_ISBN
978-1-4244-7159-1
Type
conf
DOI
10.1109/ICEEE.2010.5660513
Filename
5660513
Link To Document