Related papers: Map of Elections

Mapping is an important part of many robotic applications. In order to measure the performance of the mapping process we have to measure the quality of its result: the map. The map is essential for robotic algorithms like localization and…

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…

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…

We extend a newly developed formal system for the description of astrophysical maps. In this formalism, we consider the difference between maps to be the distance between elements of a pseudometric space (the space of all such maps). This…

We propose a new graphical format for instant-runoff voting election results. We call this proposal an "accumulation chart." This model, a modification of standard bar charts, is easy to understand, clearly indicates the winner, depicts the…

We investigate the practical aspects of computing the necessary and possible winners in elections over incomplete voter preferences. In the case of the necessary winners, we show how to implement and accelerate the polynomial-time algorithm…

Elections for public offices in democratic nations are large-scale examples of collective decision-making. As a complex system with a multitude of interactions among agents, we can anticipate that universal macroscopic patterns could emerge…

Geometric data sets arising in modern applications are often very large and change dynamically over time. A popular framework for dealing with such data sets is the evolving data framework, where a discrete structure continuously varies…

The input to the distant representatives problem is a set of $n$ objects in the plane and the goal is to find a representative point from each object while maximizing the distance between the closest pair of points. When the objects are…

Estimating a depth map from multiple views of a scene is a fundamental task in computer vision. As soon as more than two viewpoints are available, one faces the very basic question how to measure similarity across >2 image patches.…

Although manipulation and bribery have been extensively studied under weighted voting, there has been almost no work done on election control under weighted voting. This is unfortunate, since weighted voting appears in many important…

We study the problem of supervised learning a metric space under discriminative constraints. Given a universe $X$ and sets ${\cal S}, {\cal D}\subset {X \choose 2}$ of similar and dissimilar pairs, we seek to find a mapping $f:X\to Y$, into…

Embeddings mapping high-dimensional discrete input to lower-dimensional continuous vector spaces have been widely adopted in machine learning applications as a way to capture domain semantics. Interviewing 13 embedding users across…

Several measures of partisan bias are reviewed for single member districts with two dominant parties. These include variants of the simple bias that considers only deviation of seats from 50% at statewide 50% vote. Also included are…

This paper presents an enhanced version of the Interactive Voting-Based Map Matching algorithm, designed to efficiently process trajectories with varying sampling rates. The main aim is to reconstruct GPS trajectories with high accuracy,…

Two simple predicates are adopted and certain real-valued piecewise continuous functions are constructed from them. This type of maps will be called quasi-step maps and aim to separate the fixed points of an iteration map in an interval.…

Probabilistic 3D map has been applied to object segmentation with multiple camera viewpoints, however, conventional methods lack of real-time efficiency and functionality of multilabel object mapping. In this paper, we propose a method to…

Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…

There are many factors that can influence the outcome of an election. We here identify two dominant effects that can affect the votes obtained by a candidate, namely, the Majority Effect and the Media Effect. We mimic these two effects in a…

We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting…