Deepest voting: A new way of electing

@article{Aubin2021DeepestVA,
  title={Deepest voting: A new way of electing},
  author={Jean-Baptiste Aubin and Ir{\`e}ne Gannaz and Samuela Leoni and Antoine Rolland},
  journal={Mathematical Social Sciences},
  year={2021}
}
Classical approval voting processes suffer from well-known impossibility theorems. We consider grading-based voting, where voters give a grade rather than a preference to each candidate. Numerous voting processes have been proposed in this framework, such as majority judgment or range voting, showing interesting properties. This article aims to present a unified framework for grading-based voting processes. Our statement is that a voting process can be seen as the finding of the innermost point… 

Figures and Tables from this paper

A Note on Data Simulations for Voting by Evaluation
TLDR
This paper proposes in this paper several simulation models for generating evaluation-based voting inputs, inspired by classical ones, which are defined, tested and compared for recommendation purpose.

References

SHOWING 1-10 OF 45 REFERENCES
Range voting
The “range voting” system is as follows. In a ccandidate election, you select a vector of c real numbers, each of absolute value ≤ 1, as your vote. E.g. you could vote (+1,−1, +.3,−.9, +1) in a
Tie-Breaking the Highest Median: Alternatives to the Majority Judgment
The paper deals with voting rules that require voters to rate the candidates on a finite evaluation scale and then elect a candidate whose median grade is maxi- mum. These rules differ by the way
Tie-breaking the highest median: alternatives to the majority judgment
  • Adrien Fabre
  • Computer Science, Economics
    Soc. Choice Welf.
  • 2021
TLDR
The paper deals with voting rules that require voters to rate the candidates on a finite evaluation scale and then elect a candidate whose median grade is maximum and states that only a certain class of functions share some valuable characteristics, like monotonicity, which only holds true for non-discrete scales of grades.
Manipulation of Voting Schemes: A General Result
It has been conjectured that no system of voting can preclude strategic voting-the securing by a voter of an outcome he prefers through misrepresentation of his preferences. In this paper, for all
Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions
Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is
APPROVAL VOTING
Approval voting has been offered by a number of formal theorists, notably Steven Brams and Peter Fishburn (1983), as a solution to problems occasioned by multicandidate elections. The formal
Majority judgment vs. majority rule
TLDR
It is shown that majority judgment is a practical method that accommodates any number of candidates, avoids both the Condorcet and Arrow paradoxes, and best resists strategic manipulation.
A theory of measuring, electing, and ranking
  • M. Balinski, R. Laraki
  • Computer Science, Medicine
    Proceedings of the National Academy of Sciences
  • 2007
The impossibility theorems that abound in the theory of social choice show that there can be no satisfactory method for electing and ranking in the context of the traditional, 700-year-old model. A
Monotonicity and manipulability of ordinal and cardinal social choice functions
Borda’s social choice method and Condorcet’s social choice method are shown to satisfy different monotonicities and it is shown that it is impossible for any social choice method to satisfy them
On the Relevance of Irrelevant Alternatives
TLDR
The first such algorithm is presented, which runs in quadratic time under an oracle model, and it is shown that nested logit over learned nests outperforms traditional multinomial regression.
...
1
2
3
4
5
...