Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/219267 
Year of Publication: 
2019
Citation: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 10 [Issue:] 4 [Publisher:] MDPI [Place:] Basel [Year:] 2019 [Pages:] 1-17
Publisher: 
MDPI, Basel
Abstract: 
In this paper, we study the formation of endogenous social storage cloud in a dynamic setting, where rational agents build their data backup connections strategically. We propose a degree-distance-based utility model, which is a combination of benefit and cost functions. The benefit function of an agent captures the expected benefit that the agent obtains by placing its data on others' storage devices, given the prevailing data loss rate in the network. The cost function of an agent captures the cost that the agent incurs to maintain links in the network. With this utility function, we analyze what network is likely to evolve when agents themselves decide with whom they want to form links and with whom they do not. Further, we analyze which networks are pairwise stable and efficient. We show that for the proposed utility function, there always exists a pairwise stable network, which is also efficient. We show that all pairwise stable networks are efficient, and hence, the price of anarchy is the best that is possible. We also study the effect of link addition and deletion between a pair of agents on their, and others', closeness and storage availability.
Subjects: 
network externalities
network formation
pairwise stability
social storage cloud
socially-aware storage-sharing
JEL: 
C72
D62
D85
L86
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.