Title
On Shortest Path Interval Games
Abstract
In this paper, a kind of shortest path interval game is studied. The following two theorems are obtained. (1) When the coalition S owns the path, and the condition W(S)=[Wl(S),Wl(S)+c] is true for some fixed c≥0, then there exists no-empty interval core; (2) When the coalition S owns the path, and the condition W(S)=[Wl(S), (1+θ)Wl(S)] is true for some fixed θ≥0, then there exists no-empty interval core. By using the concept of the point core of the game introduced by S. Zeynep Alparslan Gök, the lower point game and upper point game are defined. Using the concept of compositive defined in this paper, the interval game is translated to two point games. By introducing the concept of critical value, it bound the range of incomes of the game. Finally, the distribution of the interval core simplified by defining the minimal supporting set.
Year
DOI
Venue
2010
10.1109/ICEE.2010.622
ICEE
Keywords
Field
DocType
zeynep alparslan gok,point core,condition w,shortest path interval games,no-empty interval core,fixed c,shortest path interval game,interval game,upper point game,interval core,compositive,game theory,point game,lower point game,minimal supporting set,economics,uncertainty,games,critical value,shortest path problem,resource management,shortest path,finance
Resource management,Discrete mathematics,Combinatorics,Shortest path problem,Existential quantification,Game theory,Mathematics
Conference
ISBN
Citations 
PageRank 
978-0-7695-3997-3
0
0.34
References 
Authors
1
2
Name
Order
Citations
PageRank
Fumin Lei1101.23
Xiaodong Liu23611.83