Approximability of Dodgson's rule (Q1024774): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61586285, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3796553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact analysis of Dodgson elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarantees for the success frequency of an algorithm for finding Dodgson-election winners / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dodgson ranking and the Borda count: a binary comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament solutions and majority voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of Dodgson's method and Kemeny's rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of Dodgson's method and the Borda count / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence of clones as a criterion for voting rules / rank
 
Normal rank

Latest revision as of 16:54, 1 July 2024

scientific article
Language Label Description Also known as
English
Approximability of Dodgson's rule
scientific article

    Statements