Sciweavers

1447 search results - page 10 / 290
» Graphs and Path Equilibria
Sort
View
INFOCOM
2007
IEEE
14 years 4 months ago
Path Selection and Multipath Congestion Control
— In this paper we investigate the potential benefits of coordinated congestion control for multipath data transfers, and contrast with uncoordinated control. For static random ...
Peter B. Key, Laurent Massoulié, Donald F. ...
TCS
2010
13 years 4 months ago
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
Mauro Mezzini
CORR
2011
Springer
153views Education» more  CORR 2011»
13 years 1 months ago
On the Windfall and Price of Friendship: Inoculation Strategies on Social Networks
This article investigates selfish behavior in games where players are embedded in a social context. A framework is presented which allows us to measure the Windfall of Friendship...
Dominic Meier, Yvonne Anne Pignolet, Stefan Schmid...
WINE
2010
Springer
251views Economy» more  WINE 2010»
13 years 7 months ago
The Complexity of Equilibria in Cost Sharing Games
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
Vasilis Syrgkanis
FAW
2010
Springer
217views Algorithms» more  FAW 2010»
13 years 8 months ago
Path Separability of Graphs
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
Emilie Diot, Cyril Gavoille