Sciweavers

231 search results - page 3 / 47
» Path disruption games
Sort
View
MOBIQUITOUS
2007
IEEE
14 years 5 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
IJAHUC
2008
80views more  IJAHUC 2008»
13 years 11 months ago
Performance evaluation of node density-based adaptive routing scheme for disruption tolerant networks
: Traditional ad hoc routing protocols do not work in intermittently connected networks since end-to-end paths may not exist in such networks. Hence, routing mechanisms that can wi...
Mooi Choo Chuah, Peng Yang
CORR
2011
Springer
212views Education» more  CORR 2011»
13 years 5 months ago
Path coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
Haris Aziz, Troels Bjerre Sørensen
MST
2010
98views more  MST 2010»
13 years 9 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis
ICALP
2009
Springer
14 years 11 months ago
A Survey of Stochastic Games with Limsup and Liminf Objectives
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...