\(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 this page instead for the normal view: \(k\)-majority digraphs and the hardness of voting with a constant number of voters |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(k\)-majority digraphs and the hardness of voting with a constant number of voters |
scientific article |
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
