Drawing a map of elections
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3148878 (Why is no real title available?)
- A live experiment on approval voting
- Advances in the spatial theory of voting.
- An Exploration in the Theory of Optimum Income Taxation
- An algorithm for drawing general undirected graphs
- An analysis of approximations for maximizing submodular set functions—I
- Approval balloting for multi-winner elections
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
- Condorcet domains, median graphs and the single-crossing property
- Control complexity in Bucklin and fallback voting: an experimental analysis
- Dependent rounding and its applications to approximation algorithms
- Distance rationalization of anonymous and homogeneous voting rules
- Distance restricted manipulation in voting
- Effective sampling and learning for Mallows models with pairwise-preference data
- Eliciting single-peaked preferences using comparison queries
- Encyclopedia of Distances
- Exact analysis of Dodgson elections
- Finding a collective set of items: from proportional multirepresentation to group recommendation
- Handbook of Computational Social Choice
- Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
- How similar are two elections?
- Local distance constrained bribery in voting
- Marriage, Magic, and Solitaire
- Modern multidimensional scaling. Theory and applications.
- Multi-winner voting with approval preferences
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- NON-NULL RANKING MODELS. I
- Network flows. Theory, algorithms, and applications.
- New Approximations for Coalitional Manipulation in Scoring Rules
- On the approximability of Dodgson and Young elections
- On the complexity of achieving proportional representation
- On the computation of fully proportional representation
- On the simulataneous election of several candidates.
- Optimizing positional scoring rules for rank aggregation
- Parameterized computational complexity of Dodgson and Young elections
- Preferences Single-Peaked on a Circle
- Proportional approval voting, harmonic \(k\)-median, and negative association
- Rationalizations of Condorcet-consistent rules via distances of Hamming type
- Rationalizations of Voting Rules
- Some measures of closeness to unanimity and their implications
- The Simple Majority Decision Rule
- The earth mover's distance as a metric for image retrieval
- The impartial, anonymous, and neutral culture model: a probability model for sampling public preference structures
- Two field experiments on approval voting in Germany
- Two-Point Step Size Gradient Methods
- Visualizing data using t-SNE
- Voting schemes for which it can be difficult to tell who won the election
- Where are the hard manipulation problems?
This page was built for publication: Drawing a map of elections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977004)