Sciweavers

231 search results - page 20 / 47
» Path disruption games
Sort
View
WAOA
2005
Springer
152views Algorithms» more  WAOA 2005»
15 years 3 months ago
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. ...
JSAC
2008
177views more  JSAC 2008»
14 years 9 months ago
Adaptive Routing Strategies in IEEE 802.16 Multi-Hop Wireless Backhaul Networks Based On Evolutionary Game Theory
The high frequency segment (10-66GHz) of the IEEE 802.16 standard seems promising for the implementation of wireless backhaul networks carrying large volumes of Internet traffic. I...
Markos P. Anastasopoulos, Pantelis-Daniel M. Arapo...
WINE
2005
Springer
179views Economy» more  WINE 2005»
15 years 3 months ago
A Graph-Theoretic Network Security Game
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
87
Voted
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
14 years 9 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
INFOCOM
2009
IEEE
15 years 4 months ago
CFP: Cooperative Fast Protection
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...
Bin Wu, Pin-Han Ho, Kwan L. Yeung, János Ta...