180 search results - page 27 / 36 » Social DTN routing |
SIGIR
2003
ACM
14 years 24 days ago
2003
ACM
We present SETS, an architecture for efficient search in peer-to-peer networks, building upon ideas drawn from machine learning and social network theory. The key idea is to arran...
ISAAC
2003
Springer
14 years 22 days ago
2003
Springer
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We examine how to induce selfish heterogeneous users in a multicommodity network to reach an equilibrium that minimizes the social cost. In the absence of centralized coordination...
MST
2010
13 years 6 months ago
2010
In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the FMNE Conjecture, in selfish routing for the s...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We study the degree to which small fluctuations in costs in wellstudied potential games can impact the result of natural best-response and improved-response dynamics. We call thi...