A note on the complexity of manipulating weighted Schulze voting (Q2203580): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2889498819 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1808.09226 / 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: When are elections with few candidates hard to manipulate? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barriers to Manipulation in Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized / 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: Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4583963 / 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: A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:34, 23 July 2024

scientific article
Language Label Description Also known as
English
A note on the complexity of manipulating weighted Schulze voting
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references