Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Guarantees for the success frequency of an algorithm for finding Dodgson-election winners |
scientific article; zbMATH DE number 5600116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Guarantees for the success frequency of an algorithm for finding Dodgson-election winners |
scientific article; zbMATH DE number 5600116 |
Statements
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (English)
0 references
31 August 2009
0 references
computational social choice
0 references
Dodgson elections
0 references
Lewis Carroll
0 references
frequently self-knowingly correct heuristics
0 references
0 references
0 references
0 references
0.9539459347724916
0 references
0.8320456743240356
0 references
0.8283761739730835
0 references
0.7897552847862244
0 references
0.7797720432281494
0 references
