Date Added: Mar 2010
In peer-to-peer storage systems, peers replicate each others' data in order to increase availability. If the matching is done centrally, the algorithm can optimize data availability in an equitable manner for all participants. However, if matching is decentralized, the peers' selfishness can greatly alter the results, leading to performance inequities that can render the system unreliable and thus ultimately unusable. The authors analyze the problem using both theoretical approaches (complexity analysis for the centralized system, game theory for the decentralized one) and simulation.