Data backup network formation with heterogeneous agents: (Extended abstract)

TLDR: Heterogeneity is included in this endogenously built symmetric social storage model by using the concept of Social Range Matrix from [5], and it is proved that under certain conditions on network parameters, a bilaterally stable network is unique.

Abstract: Social storage systems [1], [2], [3] are becoming increasingly popular compared to the existing data backup systems like local, centralized and P2P systems. An endogenously built symmetric social storage model and its aspects like the utility of each agent, bilateral stability, contentment, and efficiency have been extensively discussed in [4]. We include heterogeneity in this model by using the concept of Social Range Matrix from [5]. Now, each agent is concerned about its perceived utility, which is a linear combination of its utility as well as others utilities (depending upon whether the pair are friends, enemies or do not care about each other). We derive conditions when two agents may want to add or delete a link, and provide an algorithm that checks if a bilaterally stable network is possible or not. Finally, we take some special Social Range Matrices and prove that under certain conditions on network parameters, a bilaterally stable network is unique.