Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2014.07.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052020474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single transferable vote resists strategic voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational difficulty of manipulating an election / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is it to control an election? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a dichotomy for the possible winner problem in elections based on scoring rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reconstruction of binary and permutation matrices under (binary) tomographic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are elections with few candidates hard to manipulate? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is Bribery in Elections? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Richer Understanding of the Complexity of Election Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some further results on the manipulability of social choice rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation of Voting Schemes: A General Result / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompleteness and incomparability in preference aggregation: complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence of clones as a criterion for voting rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the coalitional manipulation problem / rank
 
Normal rank

Revision as of 05:04, 9 July 2024

scientific article
Language Label Description Also known as
English
Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
scientific article

    Statements

    Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 October 2014
    0 references
    social choice
    0 references
    voting methods
    0 references
    manipulation
    0 references
    Borda voting
    0 references
    Nanson's voting rule
    0 references
    Baldwin's voting rule
    0 references

    Identifiers