English
Related papers

Related papers: Geometric Comparisons of Electoral Rules Under Fee…

200 papers

In light of the classic impossibility results of Arrow and Gibbard and Satterthwaite regarding voting with ordinal rules, there has been recent interest in characterizing how well common voting rules approximate the social optimum. In order…

Computer Science and Game Theory · Computer Science 2017-08-29 Yu Cheng , Shaddin Dughmi , David Kempe

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

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,…

Statistical Mechanics · Physics 2009-11-11 Claudio Castellano

Politics around the world exhibits increasing polarization, demonstrated in part by rigid voting configurations in institutions like legislatures or courts. A crux of polarization is separation along a unidimensional ideological axis, but…

Physics and Society · Physics 2025-12-12 Edward D. Lee

Political polarization can be beneficial to competing political parties. I study how electoral competition itself generates incentives to polarize voters, even when parties are ex ante identical and motivated purely by political power,…

General Economics · Economics 2026-02-02 Giampaolo Bonomi

We consider a two-round election model involving $m$ voters and $n$ candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the candidates are partitioned into two subsets, $A$ and $B$,…

Computer Science and Game Theory · Computer Science 2026-03-17 Emilio De Santis , Antonio Di Crescenzo , Verdiana Mustaro

In this paper we extend some recent results on an operatorial approach to the description of alliances between political parties interacting among themselves and with a basin of electors. In particular, we propose and compare three…

Physics and Society · Physics 2017-05-24 F. Bagarello , F. Gargano

Defying the median voter theorem, party polarization has spread globally, especially in the United States. As concerns grow over its risks to democracy, political science has probed its causes, revealing two paradoxes: while polarization…

Physics and Society · Physics 2025-05-29 Roberto Venegeroles

The election control problem through social influence asks to find a set of nodes in a social network of voters to be the starters of a political campaign aiming at supporting a given target candidate. Voters reached by the campaign change…

Social and Information Networks · Computer Science 2020-07-14 Mohammad Abouei Mehrizi , Federico Corò , Emilio Cruciani , Gianlorenzo D'Angelo

Consider an undirected graph G, representing a social network, where each node is blue or red, corresponding to positive or negative opinion on a topic. In the voter model, in discrete time rounds, each node picks a neighbour uniformly at…

Social and Information Networks · Computer Science 2025-06-03 Abhiram Manohara , Ahad N. Zehmakan

We consider distributed elections, where there is a center and $k$ sites. In such distributed elections, each voter has preferences over some set of candidates, and each voter is assigned to exactly one site such that each site is aware…

Computer Science and Game Theory · Computer Science 2019-07-24 Arnold Filtser , Nimrod Talmon

The median-voter hypothesis (MVH) predicts convergence of two party platforms across a one-dimensional political spectrum during majoritarian elections. From the viewpoint of the MVH, an explanation of polarization is that each election has…

Physics and Society · Physics 2022-10-05 Jonghoon Kim , Hyeong-Chai Jeong , Seung Ki Baek

In the metric distortion problem, a set of voters and candidates lie in a common metric space, and a committee of $k$ candidates must be elected. The objective is to minimize a social cost, defined as a function of the distances between…

Computer Science and Game Theory · Computer Science 2025-10-16 Javier Cembrano , Golnoosh Shahkarami

In an election in which each voter ranks all of the candidates, we consider the head-to-head results between each pair of candidates and form a labeled directed graph, called the margin graph, which contains the margin of victory of each…

Theoretical Economics · Economics 2020-09-08 Matthew Harrison-Trainor

The main idea of the {\em distance rationalizability} approach to view the voters' preferences as an imperfect approximation to some kind of consensus is deeply rooted in social choice literature. It allows one to define ("rationalize")…

Computer Science and Game Theory · Computer Science 2010-09-03 Edith Elkind , Piotr Faliszewski , Arkadii Slinko

The simplified hypothesis that an election is polarized as an explanation of recent electoral outcomes worldwide is centered on perceptions of voting patterns rather than ideological data from the electorate. While the literature focuses on…

Computers and Society · Computer Science 2024-07-30 Carlos Navarrete , Mariana Macedo , Viktor Stojkoski , Marcela Parada-Contzen , Christopher A Martínez

We study the performance of voting mechanisms from a utilitarian standpoint, under the recently introduced framework of metric-distortion, offering new insights along three main lines. First, if $d$ represents the doubling dimension of the…

Computer Science and Game Theory · Computer Science 2022-03-25 Ioannis Anagnostides , Dimitris Fotakis , Panagiotis Patsilinakos

The voter model and the Axelrod model are two of the main stochastic processes that describe the spread of opinions on networks. The former includes social influence, the tendency of individuals to become more similar when they interact,…

Probability · Mathematics 2010-12-30 Nicolas Lanchier

We revisit the recent breakthrough result of Gkatzelis et al. on (single-winner) metric voting, which showed that the optimal distortion of 3 can be achieved by a mechanism called Plurality Matching. The rule picks an arbitrary candidate…

Computer Science and Game Theory · Computer Science 2025-02-05 Fatih Erdem Kizilkaya , David Kempe

In this paper, we study the distortion bounds for voting mechanisms in multi-winner elections in general metric spaces. Our study pertains to the case in which each voter only reports her favorite candidate amongst $m$ possible choices.…

Computer Science and Game Theory · Computer Science 2025-05-29 Gennaro Auricchio , Zeyu Ren , Zihe Wang , Jie Zhang