Externalities and stability in social cloud
TL;DR: A pairwise resource (or pairwise service) sharing social network model is presented to explore the interdependence between social structure and resource (service) availability for an individual user or player and investigates effects of social structure on individual resource availability.
Abstract: Social Clouds have been gaining importance because of their potential for efficient and stable resource sharing without any (monetary) cost implications . There is a need, however, to look at how a social structure or relationship evolves to build a Social Cloud (by identifying factors that affect the social structure) and how social structure impacts individual resource sharing behavior. This paper presents a pairwise resource (or pairwise service) sharing social network model to explore the interdependence between social structure and resource (service) availability for an individual user or player. The paper also investigates effects of social structure on individual resource availability. Further, the paper analyzes positive and negative externalities, and aims to characterize stable social clouds.
...read more
Citations
2 citations
1 citations
1 citations
References
12,074 citations
"Externalities and stability in soci..." refers background in this paper
...In social network analysis, centrality measure applied on a player finds her/ his importance or how much she/ he is prominent in the given network [15]....
[...]
6,686 citations
3,595 citations
"Externalities and stability in soci..." refers methods in this paper
...The idea of Social Cloud computing is inspired from various computing frameworks like grid VO [6] , volunteer computing [7] , P2P storage network [8]....
[...]
2,611 citations
2,516 citations
"Externalities and stability in soci..." refers background in this paper
...Jackson and Wolinsky [18] introduced the concept of pairwise stability as follows: Definition 1: A network 5 is pairwise stable if and only if 1) Ui ( S ) 2: Ui ( S -(ij)) and U j( s ) 2: U j( s -(ij)) for all (ij) E 5 2) If Ui ( S + (ij)) > Ui ( S ) , then U j( s + (ij)) U j( s ) for all (ij) � 5 Thus, a network 5 is stable when no player benefits by changing the present link structure, neither by forming new edges nor by severing existing links....
[...]
...Jackson and Wolinsky [18] introduced the concept of pairwise stability as follows: Definition 1: A network 5 is pairwise stable if and only if 1) Ui ( S ) 2: Ui ( S -(ij)) and U j( s ) 2: U j( s -(ij)) for all (ij) E 5 2) If Ui ( S + (ij)) > Ui ( S ) , then U j( s + (ij)) U j( s ) for all (ij) �…...
[...]