A Nash Equilibrium Based Algorithm for Mining Hidden Links in Social Networks

Author(s):  
Huan Ma ◽  
Zaixin Lu ◽  
Lidan Fan ◽  
Weili Wu ◽  
Deying Li ◽  
...  
2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Enqiang Liu ◽  
Zengliang Liu ◽  
Fei Shao ◽  
Zhiyong Zhang

The contents access and sharing in multimedia social networks (MSNs) mainly rely on access control models and mechanisms. Simple adoptions of security policies in the traditional access control model cannot effectively establish a trust relationship among parties. This paper proposed a novel two-party trust architecture (TPTA) to apply in a generic MSN scenario. According to the architecture, security policies are adopted through game-theoretic analyses and decisions. Based on formalized utilities of security policies and security rules, the choice of security policies in content access is described as a game between the content provider and the content requester. By the game method for the combination of security policies utility and its influences on each party’s benefits, the Nash equilibrium is achieved, that is, an optimal and stable combination of security policies, to establish and enhance trust among stakeholders.


IEEE Access ◽  
2016 ◽  
Vol 4 ◽  
pp. 8147-8161 ◽  
Author(s):  
William Hoiles ◽  
Vikram Krishnamurthy ◽  
Anup Aprem

2014 ◽  
Vol 4 (1) ◽  
Author(s):  
Yichao Zhang ◽  
M. A. Aziz-Alaoui ◽  
Cyrille Bertelle ◽  
Jihong Guan

2014 ◽  
Vol 610 ◽  
pp. 588-594
Author(s):  
Qing Feng Zhang ◽  
Sheng Wang ◽  
Dan Liao

this paper investigated resource sharing and allocation in P2P social networks which based on game theory. Firstly, resources are divided into two categories: Public goods (PG) and Club goods (CG). The PG has the following characteristics: self-less, Non-exclusive and un-competitive; but the CG has some self-ish, exclusive and competitive. The PG only to get the sharing fixed costs and transaction costs, but the CG needs to obtain more benefits over than costs. We demonstrated that when providers sharing resource is CG within sharing capacities can achieve the maximum benefits and Nash equilibrium. Secondly, peers are divided into two sets: friends set (FS) and strangers set (SS), providers allocate the CG in different sets within different pricing by the average price. Finally, simulations analyzed benefits of peers sharing the PG or the CG, and then discussed resource allocation in different sets within different payment strategies and resource pricing in the same set.


2019 ◽  
Vol 8 (2) ◽  
pp. 674-682
Author(s):  
Khadija Touya ◽  
Mohamed Baslam ◽  
Rachid El Ayachi ◽  
Mostafa Jourhmane

Social Networks have known an important evolution in the last few years. These structures, made up of individuals who are tied by one or more specific types of interdependency, constitute the window for members to express their opinions and thoughts by sending posts to their own walls or others' timelines. Actually, when a content arrives, it's located on the top of the timeline pushing away older messages. This situation causes a permanent competition over visibility among subscribers who jump on opponents to promote conflict. Our study presents this competition as a non-cooperative game; each source has to choose frequencies which assure its visibility. We model it, exploring the theory of concave games, to reach a situation of equilibrium; a situation where no player has the ultimate ability to deviate from its current strategy. We formulate the named game, then we analyze it and prove that there is exactly one Nash equilibrium which is the convergence of all players' best responses. We finally provide some numerical results, taking into consideration a system of two sources with a specific frequency space, and analyze the effect of different parameters on sources' visibility on the walls of social networks.


Author(s):  
Mark E. Dickison ◽  
Matteo Magnani ◽  
Luca Rossi

2006 ◽  
Vol 27 (2) ◽  
pp. 108-115 ◽  
Author(s):  
Ana-Maria Vranceanu ◽  
Linda C. Gallo ◽  
Laura M. Bogart

The present study investigated whether a social information processing bias contributes to the inverse association between trait hostility and perceived social support. A sample of 104 undergraduates (50 men) completed a measure of hostility and rated videotaped interactions in which a speaker disclosed a problem while a listener reacted ambiguously. Results showed that hostile persons rated listeners as less friendly and socially supportive across six conversations, although the nature of the hostility effect varied by sex, target rated, and manner in which support was assessed. Hostility and target interactively impacted ratings of support and affiliation only for men. At least in part, a social information processing bias could contribute to hostile persons' perceptions of their social networks.


Sign in / Sign up

Export Citation Format

Share Document