Related papers: Noise Stability of Ranked Choice Voting
The intersection of learning to rank and choice modeling is an active area of research with applications in e-commerce, information retrieval and the social sciences. In some applications such as recommendation systems, the statistician is…
We evaluate the tendency for different voting methods to promote political compromise and reduce tensions in a society by using computer simulations to determine which voters candidates are incentivized to appeal to. We find that Instant…
We propose a simple method for combining together voting rules that performs a run-off between the different winners of each voting rule. We prove that this combinator has several good properties. For instance, even if just one of the base…
We introduce a novel noisy sorting model motivated by the Just Noticeable Difference (JND) model from experimental psychology. The goal of our model is to capture the low quality of the data that are collected from crowdsourcing…
A voting rule decides on a probability distribution over a set of m alternatives, based on rankings of those alternatives provided by agents. We assume that agents have cardinal utility functions over the alternatives, but voting rules have…
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.…
The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…
Estimation of structure, such as in variable selection, graphical modelling or cluster analysis is notoriously difficult, especially for high-dimensional data. We introduce stability selection. It is based on subsampling in combination with…
Borda Count Method is an important theory in the field of voting theory. The basic idea and implementation methodology behind the approach is simple and straight forward. Borda Count Method has been used in sports award evaluations and many…
Are there voting methods which (i) give everyone, including minorities, an equal share of effective power even if voters act strategically, (ii) promote consensus rather than polarization and inequality, and (iii) do not favour the status…
This article extends the analysis of Atkinson, Foley, and Ganz in "Beyond the Spoiler Effect: Can Ranked-Choice Voting Solve the Problem of Political Polarization?". Their work uses a one-dimensional spatial model based on survey data from…
We consider the following distributed consensus problem: Each node in a complete communication network of size $n$ initially holds an \emph{opinion}, which is chosen arbitrarily from a finite set $\Sigma$. The system must converge toward a…
From the perspective of social choice theory, ranked-choice voting (RCV) is known to have many flaws. RCV can fail to elect a Condorcet winner and is susceptible to monotonicity paradoxes and the spoiler effect, for example. We use a…
Feature selection has remained a daunting challenge in machine learning and artificial intelligence, where increasingly complex, high-dimensional datasets demand principled strategies for isolating the most informative predictors. Despite…
We use Hotelling's spatial model of competition to investigate the position-taking behaviour of political candidates under a class of electoral systems known as scoring rules. In a scoring rule election, voters rank all the candidates…
Crowdsourcing systems aggregate decisions of many people to help users quickly identify high-quality options, such as the best answers to questions or interesting news stories. A long-standing issue in crowdsourcing is how option quality…
The noise stability of a Euclidean set $A$ with correlation $\rho$ is the probability that $(X,Y)\in A\times A$, where $X,Y$ are standard Gaussian random vectors with correlation $\rho\in(0,1)$. It is well-known that a Euclidean set of…
Streamlined Byzantine Fault Tolerant (BFT) protocols, such as HotStuff [PODC'19], and weighted voting represent two possible strategies to improve consensus in the distributed systems world. Several studies have been conducted on both…
Arrow proved that for three or more candidates, the IIA condition is enough to forbid all non-dictatorial election rules (or Social Welfare Functions). Maskin introduced the weaker MIIA condition, which permits the ``Borda'' election rules…
Maximum likelihood estimation furnishes powerful insights into voting theory, and the design of voting rules. However the MLE can usually be badly corrupted by a single outlying sample. This means that a single voter or a group of colluding…