\(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7089549
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(k\)-majority digraphs and the hardness of voting with a constant number of voters |
scientific article; zbMATH DE number 7089549 |
Statements
\(k\)-majority digraphs and the hardness of voting with a constant number of voters (English)
0 references
7 August 2019
0 references
computational social choice
0 references
voting
0 references
tournaments
0 references
NP-hardness
0 references
0 references
0 references
0.7939875721931458
0 references
0.7683930993080139
0 references
0.7682908773422241
0 references
0.7631816864013672
0 references
0.7605410218238831
0 references
