Related papers: Plurality in Spatial Voting Games with constant $\…
Voters making a binary decision purchase votes from a centralized clearing house, paying the square of the number of votes purchased. The net payoff to an agent with utility $u$ who purchases $v$ votes is $\Psi (S_{n+1})u-v^{2}$, where…
In collective decision making, where a voting rule is used to take a collective decision among a group of agents, manipulation by one or more agents is usually considered negative behavior to be avoided, or at least to be made…
We introduce the voter model on the infinite lattice with a slow membrane and investigate its hydrodynamic behavior and nonequilibrium fluctuations. The model is defined as follows: a voter adopts one of its neighbors' opinion at rate one…
We study a nonequilibrium model with up-down symmetry and a noise parameter $q$ known as majority-vote model of M.J. Oliveira 1992 with heterogeneous agents on square lattice. By Monte Carlo simulations and finite-size scaling relations the…
A preference profile with m alternatives and n voters is 2-dimensional Euclidean if both the alternatives and the voters can be placed into a 2-dimensional space such that for each pair of alternatives, every voter prefers the one which has…
Given a graph $G = (V,E)$, an $(\alpha, \beta)$-ruling set is a subset $S \subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is…
In elections, the vote shares or turnout rates show a strong spatial correlation. The logarithmic decay with distance suggests that a 2D noisy diffusive equation describes the system. Based on the study of U.S. presidential elections data,…
For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…
Many societal decision problems lie in high-dimensional continuous spaces not amenable to the voting techniques common for their discrete or single-dimensional counterparts. These problems are typically discretized before running an…
Using the calculus of variations, we prove the following structure theorem for noise stable partitions: a partition of $n$-dimensional Euclidean space into $m$ disjoint sets of fixed Gaussian volumes that maximize their noise stability must…
In the d dimensional Euclidean space, any set of n+1 independent random points, uniformly distributed in the interior of a unit ball of center O, determines almost surely a circumsphere of center C and of radius R, with n positive and less…
Consider the decision-making setting where agents elect a panel by expressing both positive and negative preferences. Prominently, in constitutional AI, citizens democratically select a slate of ethical preferences on which a foundation…
We consider the repeated prisoner's dilemma (PD). We assume that players make their choices knowing only average payoffs from the previous stages. A player's strategy is a function from the convex hull $\mathfrak{S}$ of the set of payoffs…
In a party-based election system, the voters are grouped into parties and all voters of a party are assumed to vote according to the party preferences over the candidates. Hence, once the party preferences are declared the outcome of the…
In this paper we characterise cone points of arbitrary subsets of Euclidean space. Given $E \subset \mathbb{R}^n$, $x \in E$ is a cone point of $E$ if and only if \begin{align*} \int_{0}^1 \beta_{E}^{d,2}(B(x,r))^2 \frac{dr}{r} < \infty,…
We introduce the vacillating voter model in which each voter consults two neighbors to decide its state, and changes opinion if it disagrees with either neighbor. This irresolution leads to a global bias toward zero magnetization. In…
By the Gibbard--Satterthwaite theorem, every reasonable voting rule for three or more alternatives is susceptible to manipulation: there exist elections where one or more voters can change the election outcome in their favour by…
We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…
This paper introduces the Voting with Random Proposers (VRP) procedure to address the challenges of agenda manipulation in voting. In each round of VRP, a randomly selected proposer suggests an alternative that is voted on against the…
Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethnicity (when selecting…