Related papers: Invasion Dynamics in the Biased Voter Process
Voting theory has become increasingly integrated with computational social choice and multiagent systems. Computational complexity has been extensively used as a shield against manipulation of voting systems, however for several voting…
Evolutionary dynamics on graphs can lead to many interesting and counterintuitive findings. We study the Moran process, a discrete time birth-death process, that describes the invasion of a mutant type into a population of wild-type…
Invasion fronts in ecology are well studied but very few mathematical results concern the case with variable motility (possibly due to mutations). Based on an apparently simple reaction-diffusion equation, we explain the observed phenomena…
We study the competition between several advantageous mutants in an asexual population (clonal interference) as a function of the time between the appearance of the mutants, their selective advantages, and the rate of deleterious mutations.…
In this work we study the process of mutant invasion on an example of a consumer-resource system with annual character of the behavior. Namely, individuals are active during seasons of fixed length separated by winter periods. All…
We study computational questions in a game-theoretic model that, in particular, aims to capture advertising/persuasion applications such as viral marketing. Specifically, we consider a multi-agent Bayesian persuasion model where an informed…
We consider one-dimensional biased voter models, where 1's replace 0's at a faster rate than the other way round, started in a Heaviside initial state describing the interface between two infinite populations of 0's and 1's. In the limit of…
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal results have shown that all general voting protocols are…
Strategies aimed at reducing the negative effects of long-term uncertainty and risk are common in biology, game theory, and finance, even if they entail a cost in terms of mean benefit. Here, we focus on the single mutant's invasion of a…
We derive rigorous estimates on the speed of invasion of an advantageous trait in a spatially advancing population in the context of a system of one-dimensional F-KPP equations. The model was introduced and studied heuristically and…
We study the dynamics of opinion formation in a heterogeneous voter model on a complete graph, in which each agent is endowed with an integer fitness parameter $k \ge 0$, in addition to its $+$ or $-$ opinion state. The evolution of the…
A negotiating team is a group of two or more agents who join together as a single negotiating party because they share a common goal related to the negotiation. Since a negotiating team is composed of several stakeholders, represented as a…
The voter model is a paradigm of ordering dynamics. At each time step, a random node is selected and copies the state of one of its neighbors. Traditionally, this state has been considered as a binary variable. Here, we relax this…
Gerrymandering is a practice of manipulating district boundaries and locations in order to achieve a political advantage for a particular party. Lewenberg, Lev, and Rosenschein [AAMAS 2017] initiated the algorithmic study of a…
We study large fluctuations in evolutionary games belonging to the coordination and anti-coordination classes. The dynamics of these games, modeling cooperation dilemmas, is characterized by a coexistence fixed point separating two…
We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects…
Most analyses of manipulation of voting schemes have adopted two assumptions that greatly diminish their practical import. First, it is usually assumed that the manipulators have full knowledge of the votes of the nonmanipulating agents.…
Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the…
We investigate the novel problem of voting-based opinion maximization in a social network: Find a given number of seed nodes for a target campaigner, in the presence of other competing campaigns, so as to maximize a voting-based score for…
We study a stochastic differential equation driven by a Poisson point process, which models continuous changes in a population's environment, as well as the stochastic fixation of beneficial mutations that might compensate for this change.…