相关论文: Percolation Threshold for Competitive Influence in…

Diffusion mechanism design, which investigate how to incentivise agents to invite as many colleagues to a multi-agent decision making as possible, is a new research paradigm at the intersection between microeconomics and computer science.…

Motivated by applications to word-of-mouth advertising, we consider a game-theoretic scenario in which competing advertisers want to target initial adopters in a social network. Each advertiser wishes to maximize the resulting cascade of…

The margin of victory of an election is a useful measure to capture the robustness of an election outcome. It also plays a crucial role in determining the sample size of various algorithms in post election audit, polling etc. In this work,…

Mean field theory models of percolation on networks provide analytic estimates of network robustness under node or edge removal. We introduce a new mean field theory model based on generating functions that includes information about the…

Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…

We introduce and study the reverse voter model, a dynamics for spin variables similar to the well-known voter dynamics. The difference is in the way neighbors influence each other: once a node is selected and one among its neighbors chosen,…

The spread of influence in networks is a topic of great importance in many application areas. For instance, one would like to maximise the coverage, limiting the budget for marketing campaign initialisation and use the potential of social…

The probability of a given candidate winning a future election is worked out in closed form as a function of (i) the current support rates for each candidate, (ii) the relative positioning of the candidates within the political spectrum,…

We consider the problem of multi-choice majority voting in a network of $n$ agents where each agent initially selects a choice from a set of $K$ possible choices. The agents try to infer the choice in majority merely by performing local…

We consider the problem of controlling the spread of harmful items in networks, such as the contagion proliferation of diseases or the diffusion of fake news. We assume the linear threshold model of diffusion where each node has a threshold…

We consider a coupled Polya's urn scheme for social dynamics on networks. Agents hold continuum-valued opinions on a two-state issue and randomly converse with their neighbors on a graph, agreeing on one of the two states. The probability…

This study considers a simple variation of the voter model with two competing parties. In particular, we represent the case of political elections, where people can choose to support one of the two candidates or to remain neutral. People…

The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational…

We consider the distributed single-winner metric voting problem on a line, where agents and alternative are represented by points on the line of real numbers, the agents are partitioned into disjoint districts, and the goal is to choose a…

Election control considers the problem of an adversary who attempts to tamper with a voting process, in order to either ensure that their favored candidate wins (constructive control) or another candidate loses (destructive control). As…

We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in complex networks using a message passing approach to evaluate heterogeneous, node dependent probabilities of belonging to the giant or…

Threshold based models have been widely used in characterizing collective behavior on social networks. An individual's threshold indicates the minimum level of influence that must be exerted, by other members of the population engaged in…

A widely studied process of influence diffusion in social networks posits that the dynamics of influence diffusion evolves as follows: Given a graph $G=(V,E)$, representing the network, initially \emph{only} the members of a given…

Here we present \texttt{electoral\_sim}, an open-source Python framework for simulating and comparing electoral systems across diverse voter preference distributions. The framework represents voters and candidates as points in a…

Election results are determined by numerous social factors that affect the formation of opinion of the voters, including the network of interactions between them and the dynamics of opinion influence. In this work we study the result of…