Date Added: Sep 2012
In an overlay network for routing or peer-to-peer file sharing, each node must select a fixed number of overlay neighbors for routing traffic. A selfish node entering such network would select adjacent nodes so as to reduce the weighted sum of expected access costs to all its destinations. Previous work on selfish neighbor selection has built intuition with simple models where edges are undirected, access costs are modeled by hop-counts, and nodes have potentially unbounded degrees. However, in practice, important constraints not captured by these models lead to richer games with substantively and fundamentally different outcomes.