Related papers: Replicating Electoral Success
We study a simple continuous-time multi-agent system related to Krause's model of opinion dynamics: each agent holds a real value, and this value is continuously attracted by every other value differing from it by less than 1, with an…
We study a \emph{Plurality-Consensus} process in which each of $n$ anonymous agents of a communication network initially supports an opinion (a color chosen from a finite set $[k]$). Then, in every (synchronous) round, each agent can revise…
The drastic effect of local alliances in three-party competition is investigated in democratic hierarchical bottom-up voting. The results are obtained analytically using a model which extends a sociophysics frame introduced in 1986…
Predicting the winner of an election is a favorite problem both for news media pundits and computational social choice theorists. Since it is often infeasible to elicit the preferences of all the voters in a typical prediction scenario, a…
The problem of consensus in the presence of adversarially behaving agents has been studied extensively in the literature. The proposed algorithms typically guarantee that the consensus value lies within the convex hull of initial normal…
The Schelling model of segregation looks to explain the way in which a population of agents or particles of two types may come to organise itself into large homogeneous clusters, and can be seen as a variant of the Ising model in which the…
In a district-based election, we apply a voting rule $r$ to decide the winners in each district, and a candidate who wins in a maximum number of districts is the winner of the election. We present efficient sampling-based algorithms to…
Current models for opinion dynamics typically utilize a Poisson process for speaker selection, making the waiting time between events exponentially distributed. Human interaction tends to be bursty, though, having higher probabilities of…
Competition for a limited resource is the hallmark of many complex systems, and often, that resource turns out to be the physical space itself. In this work, we study a novel model designed to elucidate the dynamics and emergence in complex…
We propose a game-theoretic dynamics of a population of replicating individuals. It consists of two parts: the standard replicator one and a migration between two different habitats. We consider symmetric two-player games with two…
Political candidates often shift their positions opportunistically in hopes of capturing more votes. When there are only two candidates, the best strategy for each of them is often to move towards the other. This eventually results in two…
In real-world settings of the Deferred Acceptance stable matching algorithm, such as the American medical residency match (NRMP), school choice programs, and various national university entrance systems, candidates need to decide which…
Voting can abstractly model any decision-making scenario and as such it has been extensively studied over the decades. Recently, the related literature has focused on quantifying the impact of utilizing only limited information in the…
We build simple models for the distribution of voting patterns in a group, using the Supreme Court of the United States as an example. The least structured, or maximum entropy, model that is consistent with the observed pairwise…
A national voting population, when segmented into groups like, for example, different states, can yield a counter-intuitive scenario where the winner may not necessarily get the most number of total votes. A recent example is the 2016…
We consider the following distributed consensus problem: Each node in a complete communication network of size $n$ initially holds an \emph{opinion}, which is chosen arbitrarily from a finite set $\Sigma$. The system must converge toward a…
People often interact repeatedly: with relatives, through file sharing, in politics, etc. Many such interactions are reciprocal: reacting to the actions of the other. In order to facilitate decisions regarding reciprocal interactions, we…
We consider synchronous iterative voting, where voters are given the opportunity to strategically choose their ballots depending on the outcome deduced from the previous collective choices.We propose two settings for synchronous iterative…
We consider multiwinner elections in Euclidean space using the minimax Chamberlin-Courant rule. In this setting, voters and candidates are embedded in a $d$-dimensional Euclidean space, and the goal is to choose a committee of $k$…
Multiwinner voting captures a wide variety of settings, from parliamentary elections in democratic systems to product placement in online shopping platforms. There is a large body of work dealing with axiomatic characterizations,…