Related papers: A two-player voting game in Euclidean space
We propose a new version of the spatial model of voting. Platforms of five parties are evolving in a two-dimensional landscape of political issues so as to get maximal numbers of voters. For a Gaussian landscape the evolution leads to a…
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…
There is a class of models for pol/mil/econ bargaining and conflict that is loosely based on the Median Voter Theorem which has been used with great success for about 30 years. However, there are fundamental mathematical limitations to…
Democracies are built upon secure and reliable voting systems. Electronic voting systems seek to replace ballot papers and boxes with computer hardware and software. Proposed electronic election schemes have been subjected to scrutiny, with…
We investigate the problem of winner determination from computational social choice theory in the data stream model. Specifically, we consider the task of summarizing an arbitrarily ordered stream of $n$ votes on $m$ candidates into a small…
Most social choice rules assume access to full rankings, while current alignment practice -- despite aiming for diversity -- typically treats voters as anonymous and comparisons as independent, effectively extracting only about one bit per…
We investigate the Euclidean $d$-Dimensional Stable Roommates problem, which asks whether a given set~$V$ of $d \cdot n$ points from the 2-dimensional Euclidean space can be partitioned into $n$ disjoint (unordered) subsets…
We study the election control problem with multi-votes, where each voter can present a single vote according different views (or layers, we use "layer" to represent "view"). For example, according to the attributes of candidates, such as:…
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…
We study the problem of searching for a target at some unknown location in $\mathbb{R}^d$ when additional information regarding the position of the target is available in the form of predictions. In our setting, predictions come as…
We study the following combinatorial game played by two players, Alice and Bob, which generalizes the Pizza game considered by Brown, Winkler and others. Given a connected graph G with nonnegative weights assigned to its vertices, the…
Spatial voting models of legislators' preferences are used in political science to test theories about their voting behavior. These models posit that legislators' ideologies as well as the ideologies reflected in votes for and against a…
The whitespace-discovery problem describes two parties, Alice and Bob, trying to establish a communication channel over one of a given large segment of whitespace channels. Subsets of the channels are occupied in each of the local…
The goal of this work is to find the asymptotics of the hitting probability of a distant point for the voter model on the integer lattice started from a single 1 at the origin. In dimensions 2 or 3, we obtain the precise asymptotic behavior…
We study electoral campaign management scenarios in which an external party can buy votes, i.e., pay the voters to promote its preferred candidate in their preference rankings. The external party's goal is to make its preferred candidate a…
Each voter $i \in I$ has $\alpha_i$ cards that (s)he distributes among the candidates $a \in A$ as a measure of approval. One (or several) candidate(s) who received the maximum number of cards is (are) elected. We provide polynomial…
The Hotelling-Downs model considers parties changing policy to maximise their vote-share. Where policy position lies on a left-right axis, it describes a tendency for political parties to move towards centrist platforms. This is in contrast…
We consider a two-player search game on a tree $T$. One vertex (unknown to the players) is randomly selected as the target. The players alternately guess vertices. If a guess $v$ is not the target, then both players are informed in which…
Condorcet's paradox is a fundamental result in social choice theory which states that there exist elections in which, no matter which candidate wins, a majority of voters prefer a different candidate. In fact, even if we can select any $k$…
In repeated games, players choose actions concurrently at each step. We consider a parameterized setting of repeated games in which the players form a population of an arbitrary size. Their utility functions encode a reachability objective.…