1447 search results - page 2 / 290 » Graphs and Path Equilibria |
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
WINE
2005
Springer
13 years 10 months ago
2005
Springer
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We give a novel proof of the existence of Nash equilibria in all finite games without using fixed point theorems or path following arguments. Our approach relies on a new notion i...
CN
2010
13 years 4 months ago
2010
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...