12 research outputs found
Performance Analysis of Online Social Platforms
We introduce an original mathematical model to analyze the diffusion of posts
within a generic online social platform. Each user of such a platform has his
own Wall and Newsfeed, as well as his own self-posting and re-posting activity.
As a main result, using our developed model, we derive in closed form the
probabilities that posts originating from a given user are found on the Wall
and Newsfeed of any other. These probabilities are the solution of a linear
system of equations. Conditions of existence of the solution are provided, and
two ways of solving the system are proposed, one using matrix inversion and
another using fixed-point iteration. Comparisons with simulations show the
accuracy of our model and its robustness with respect to the modeling
assumptions. Hence, this article introduces a novel measure which allows to
rank users by their influence on the social platform, by taking into account
not only the social graph structure, but also the platform design, user
activity (self- and re-posting), as well as competition among posts.Comment: Preliminary version of accepted paper at INFOCOM 2019 (Paris, France
A Formal Separation Between Strategic and Nonstrategic Behavior
It is common in multiagent systems to make a distinction between "strategic"
behavior and other forms of intentional but "nonstrategic" behavior: typically,
that strategic agents model other agents while nonstrategic agents do not.
However, a crisp boundary between these concepts has proven elusive. This
problem is pervasive throughout the game theoretic literature on bounded
rationality and particularly critical in parts of the behavioral game theory
literature that make an explicit distinction between the behavior of
"nonstrategic" level-0 agents and "strategic" higher-level agents (e.g., the
level-k and cognitive hierarchy models). Overall, work discussing bounded
rationality rarely gives clear guidance on how the rationality of nonstrategic
agents must be bounded, instead typically just singling out specific decision
rules and informally asserting them to be nonstrategic (e.g., truthfully
revealing private information; randomizing uniformly). In this work, we propose
a new, formal characterization of nonstrategic behavior. Our main contribution
is to show that it satisfies two properties: (1) it is general enough to
capture all purportedly "nonstrategic" decision rules of which we are aware in
the behavioral game theory literature; (2) behavior that obeys our
characterization is distinct from strategic behavior in a precise sense
Optimal Targeting in Super-Modular Games
We study an optimal targeting problem for super-modular games with binary
actions and finitely many players. The considered problem consists in the
selection of a subset of players of minimum size such that, when the actions of
these players are forced to a controlled value while the others are left to
repeatedly play a best response action, the system will converge to the
greatest Nash equilibrium of the game. Our main contributions consist in
showing that the problem is NP-complete and in proposing an efficient iterative
algorithm with provable convergence properties for its solution. We discuss in
detail the special case of network coordination games and its relation with the
notion of cohesiveness. Finally, we show with simulations the strength of our
approach with respect to naive heuristics based on classical network centrality
measures
Online and Offline Dynamic Influence Maximization Games Over Social Networks
In this work, we consider dynamic influence maximization games over social
networks with multiple players (influencers). The goal of each influencer is to
maximize their own reward subject to their limited total budget rate
constraints. Thus, influencers need to carefully design their investment
policies considering individuals' opinion dynamics and other influencers'
investment strategies, leading to a dynamic game problem. We first consider the
case of a single influencer who wants to maximize its utility subject to a
total budget rate constraint. We study both offline and online versions of the
problem where the opinion dynamics are either known or not known a priori. In
the singe-influencer case, we propose an online no-regret algorithm, meaning
that as the number of campaign opportunities grows, the average utilities
obtained by the offline and online solutions converge. Then, we consider the
game formulation with multiple influencers in offline and online settings. For
the offline setting, we show that the dynamic game admits a unique Nash
equilibrium policy and provide a method to compute it. For the online setting
and with two influencers, we show that if each influencer applies the same
no-regret online algorithm proposed for the single-influencer maximization
problem, they will converge to the set of -Nash equilibrium policies
where scales in average inversely with the
number of campaign times considering the average utilities of the
influencers. Moreover, we extend this result to any finite number of
influencers under more strict requirements on the information structure.
Finally, we provide numerical analysis to validate our results under various
settings.Comment: This work has been submitted to IEEE for possible publicatio
Optimal multiphase investment strategies for influencing opinions in a social network
International audienceWe study the problem of two competing camps aiming to maximize the adoption of their respective opinions, by optimally investing in nodes of a social network in multiple phases. The final opinion of a node in a phase acts as its biased opinion in the following phase. Using an extension of Friedkin-Johnsen model, we formulate the camps' utility functions, which we show to involve what can be interpreted as multiphase Katz centrality. We hence present optimal investment strategies of the camps, and the loss incurred if myopic strategy is employed. Simulations affirm that nodes attributing higher weightage to bias necessitate higher investment in initial phase. The extended version of this paper analyzes a setting where a camp's influence on a node depends on the node's bias; we show existence and polynomial time computability of Nash equilibrium
A Two Phase Investment Game for Competitive Opinion Dynamics in Social Networks
We propose a setting for two-phase opinion dynamics in social networks, where
a node's final opinion in the first phase acts as its initial biased opinion in
the second phase. In this setting, we study the problem of two camps aiming to
maximize adoption of their respective opinions, by strategically investing on
nodes in the two phases. A node's initial opinion in the second phase naturally
plays a key role in determining the final opinion of that node, and hence also
of other nodes in the network due to its influence on them. More importantly,
this bias also determines the effectiveness of a camp's investment on that node
in the second phase. To formalize this two-phase investment setting, we propose
an extension of Friedkin-Johnsen model, and hence formulate the utility
functions of the camps. There is a tradeoff while splitting the budget between
the two phases. A lower investment in the first phase results in worse initial
biases for the second phase, while a higher investment spares a lower available
budget for the second phase. We first analyze the non-competitive case where
only one camp invests, for which we present a polynomial time algorithm for
determining an optimal way to split the camp's budget between the two phases.
We then analyze the case of competing camps, where we show the existence of
Nash equilibrium and that it can be computed in polynomial time under
reasonable assumptions. We conclude our study with simulations on real-world
network datasets, in order to quantify the effects of the initial biases and
the weightage attributed by nodes to their initial biases, as well as that of a
camp deviating from its equilibrium strategy. Our main conclusion is that, if
nodes attribute high weightage to their initial biases, it is advantageous to
have a high investment in the first phase, so as to effectively influence the
biases to be harnessed in the second phase
Ranking Online Social Users by their Influence
We introduce an original mathematical model to analyse the diffusion of posts
within a generic online social platform. The main novelty is that each user is
not simply considered as a node on the social graph, but is further equipped
with his/her own Wall and Newsfeed, and has his/her own individual self-posting
and re-posting activity. As a main result using our developed model, we derive
in closed form the probabilities that posts originating from a given user are
found on the Wall and Newsfeed of any other. These are the solution of a linear
system of equations, which can be resolved iteratively. In fact, our model is
very flexible with respect to the modelling assumptions. Using the
probabilities derived from the solution, we define a new measure of per-user
influence over the entire network, the -score, which combines the user
position on the graph with user (re-)posting activity. In the homogeneous case
where all users have the same activity rates, it is shown that a variant of the
-score is equal to PageRank. Furthermore, we compare the new model and
its -score against the empirical influence measured from very large data
traces (Twitter, Weibo). The results illustrate that these new tools can
accurately rank influencers with asymmetric (re-)posting activity for such real
world applications.Comment: 18 pages, 7 figures, journal publications. arXiv admin note: text
overlap with arXiv:1902.0718
A two phase investment game for competitive opinion dynamics in social networks
International audienceWe propose a setting for two-phase opinion dynamics in social networks, where a node's final opinion in the first phase acts as its initial biased opinion in the second phase. In this setting, we study the problem of two camps aiming to maximize adoption of their respective opinions, by strategically investing on nodes in the two phases. A node's initial opinion in the second phase naturally plays a key role in determining the final opinion of that node, and hence also of other nodes in the network due to its influence on them. However, more importantly, this bias also determines the effectiveness of a camp's investment on that node in the second phase. In order to formalize this two-phase investment setting, we propose an extension of Friedkin-Johnsen model, and hence formulate the utility functions of the camps. We arrive at a decision parameter which can be interpreted as two-phase Katz centrality. There is a natural tradeoff while splitting the available budget between the two phases. A lower investment in the first phase results in worse initial biases in the network for the second phase. On the other hand, a higher investment in the first phase spares a lower available budget for the second phase, resulting in an inability to fully harness the influenced biases. We first analyze the non-competitive case where only one camp invests, for which we present a polynomial time algorithm for determining an optimal way to split the camp's budget between the two phases. We then analyze the case of competing camps, where we show the existence of Nash equilibrium and that it can be computed in polynomial time under reasonable assumptions. We conclude our study with simulations on real-world network datasets, in order to quantify the effects of the initial biases and the weightage attributed by nodes to their initial biases, as well as that of a camp deviating from its equilibrium strategy. Our main conclusion is that, if nodes attribute high weightage to their initial biases, it is advantageous to have a high investment in the first phase, so as to effectively influence the biases to be harnessed in the second phase
Optimal investment strategies for competing camps in a social network: a broad framework
International audienceWe study the problem of optimally investing in nodes of a social network in a competitive setting, wherein two camps aim to drive the average opinion of the population in their own favor. Using a well-established model of opinion dynamics, we formulate the problem as a zero-sum game with its players being the two camps. We derive optimal investment strategies for both camps, and show that a random investment strategy is optimal when the underlying network follows a popular class of weight distributions. We study a broad framework, where we consider various well-motivated settings of the problem, namely, when the influence of a camp on a node is a concave function of its investment on that node, when a camp aims at maximizing competitor's investment or deviation from its desired investment, and when one of the camps has uncertain information about the values of the model parameters. We also study a Stackelberg variant of this game under common coupled constraints on the combined investments by the camps and derive their equilibrium strategies, and hence quantify the first-mover advantage. For a quantitative and illustrative study, we conduct simulations on real-world datasets and provide results and insights
When Influencers Compete on Social Networks
Also available at https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3546523We study an opinion formation game between a Designer and an Adversary. While the Designer creates the network, both these players can influence network nodes (agents) initially, with ties being broken in favor of the Designer. Final opinions of agents are a convex combination of own opinions and the average network peer opinion. The optimal influence strategy shows threshold effects with non-empty equilibrium networks having star type architectures. By contrast, when the tie-breaking rule favors the Adversary, non-empty equilibrium networks are regular networks. The effect of random interactions between network nodes altering the network is also studied