Selfish allocation avoidance for P2P file application: A game theoretic approach

Abstract

In this paper, we focus and solve the selfish allocation-problem that is different from the previously studied version in three ways that make it more accurately reflective of real world P2P allocation: (1) we treat the nodes as strategic agents and treat the replica allocation as a deliberate auction where node is incentivized to give his true quality of… (More)
DOI: 10.1109/ICON.2012.6506598

Topics

5 Figures and Tables

Slides referencing similar topics