English
Related papers

Related papers: Discrete Incremental Voting on Expanders

200 papers

We study simple interacting particle systems on heterogeneous networks, including the voter model and the invasion process. These are both two-state models in which in an update event an individual changes state to agree with a neighbor.…

Physics and Society · Physics 2009-09-29 V. Sood , Tibor Antal , S. Redner

We study a variant of the voter model on a coevolving network in which interactions of two individuals with differing opinions only lead to an agreement on one of these opinions with a fixed probability $q$. Otherwise, with probability…

Probability · Mathematics 2025-12-23 Raphael Eichhorn , Felix Hermann , Marco Seiler

This paper proposes a voting process in which voters allocate fractional votes to their expected utility in different domains: over proposals, other participants, and sets containing proposals and participants. This approach allows for a…

Social and Information Networks · Computer Science 2025-04-21 Yasushi Sakai , Parfait Atchade-Adelomou , Ryan Jiang , Luis Alonso , Kent Larson , Ken Suzuki

We consider a discrete-time voter model process on a set of nodes, each being in one of two states, either 0 or 1. In each time step, each node adopts the state of a randomly sampled neighbor according to sampling probabilities, referred to…

Optimization and Control · Mathematics 2022-11-28 Milan Vojnovic , Kaifang Zhou

Online social networks have become primary means of communication. As they often exhibit undesirable effects such as hostility, polarisation or echo chambers, it is crucial to develop analytical tools that help us better understand them. In…

Social and Information Networks · Computer Science 2024-02-22 Antoine Vendeville , Shi Zhou , Benjamin Guedj

We study the problem of minimizing metric distortion in multi-winner elections, where a committee of size $k$ is selected from a set of candidates based on voters' ordinal preferences. We assume that voters and candidates are embedded on a…

Computer Science and Game Theory · Computer Science 2026-02-18 Negar Babashah , Hasti Karimi , Masoud Seddighin , Golnoosh Shahkarami

In this paper, we discuss a voting model with two candidates, C_1 and C_2. We set two types of voters--herders and independents. The voting of independent voters is based on their fundamental values; on the other hand, the voting of herders…

Physics and Society · Physics 2015-05-27 Masato Hisakado , Shintaro Mori

Approval voting is a common method of preference aggregation where voters vote by ``approving'' of a subset of candidates and the winner(s) are those who are approved of by the largest number of voters. In approval voting, the degree to…

Computer Science and Game Theory · Computer Science 2023-07-19 Hari Sarang Nathan

We study positional voting rules when candidates and voters are embedded in a common metric space, and cardinal preferences are naturally given by distances in the metric space. In a positional voting rule, each candidate receives a score…

Computer Science and Game Theory · Computer Science 2017-11-22 Yu Cheng , Shaddin Dughmi , David Kempe

We consider the median dynamics process in general graphs. In this model, each vertex has an independent initial opinion uniformly distributed in the interval [0,1] and, with rate one, updates its opinion to coincide with the median of its…

Probability · Mathematics 2023-01-03 Gideon Amir , Rangel Baldasso , Nissan Beilin

Two of the main factors shaping an individual's opinion are social coordination and personal preferences, or personal biases. To understand the role of those and that of the topology of the network of interactions, we study an extension of…

Physics and Society · Physics 2023-06-07 Filippo Zimmaro , Pierluigi Contucci , János Kertész

Progress in theoretical physics is often made by the investigation of toy models, the model organisms of physics, which provide benchmarks for new methodologies. For complex systems, one such model is the adaptive voter model. Despite its…

Dynamical Systems · Mathematics 2014-10-24 Holly Silk , Güven Demirel , Martin Homer , Thilo Gross

We derive the distribution of the maximum number of common neighbours of a pair of vertices in a dense random regular graph.The proof involves two important steps. One step is to establish the extremal independence property: the asymptotic…

Combinatorics · Mathematics 2024-12-02 Mikhail Isaev , Maksim Zhukovskii

Online discussion platforms are a vital part of the public discourse in a deliberative democracy. However, how to interpret the outcomes of the discussions on these platforms is often unclear. In this paper, we propose a novel and…

Computer Science and Game Theory · Computer Science 2024-02-09 Michael Bernreiter , Jan Maly , Oliviero Nardi , Stefan Woltran

We consider the edge-reinforced random walk with multiple (but finitely many) walkers which influence the edge weights together. The walker which moves at a given time step is chosen uniformly at random, or according to a fixed order.…

Probability · Mathematics 2023-11-16 Nina Gantert , Fabian Michel , Guilherme Reis

The wisdom of the crowd has long become the de facto approach for eliciting information from individuals or experts in order to predict the ground truth. However, classical democratic approaches for aggregating individual \emph{votes} only…

Computer Science and Game Theory · Computer Science 2021-05-21 Hadi Hosseini , Debmalya Mandal , Nisarg Shah , Kevin Shi

Coalitional manipulation in voting is considered to be any scenario in which a group of voters decide to misrepresent their vote in order to secure an outcome they all prefer to the first outcome of the election when they vote honestly. The…

Theoretical Economics · Economics 2020-09-28 Mostapha Diss , Boris Tsvelikhovskiy

In distortion-based analysis of social choice rules over metric spaces, one assumes that all voters and candidates are jointly embedded in a common metric space. Voters rank candidates by non-decreasing distance. The mechanism, receiving…

Computer Science and Game Theory · Computer Science 2019-11-21 David Kempe

We investigate coarsening and persistence in the voter model by introducing the quantity $P_n(t)$, defined as the fraction of voters who changed their opinion n times up to time t. We show that $P_n(t)$ exhibits scaling behavior that…

Condensed Matter · Physics 2009-10-28 E. Ben-Naim , L. Frachebourg , P. L. Krapivsky

This paper deals with randomized polling of a social network. In the case of forecasting the outcome of an election between two candidates A and B, classical intent polling asks randomly sampled individuals: who will you vote for?…

Social and Information Networks · Computer Science 2021-05-06 Buddhika Nettasinghe , Vikram Krishnamurthy