Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules (Q413279)
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: Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules |
scientific article; zbMATH DE number 6030958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules |
scientific article; zbMATH DE number 6030958 |
Statements
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules (English)
0 references
4 May 2012
0 references
computational complexity
0 references
computational social choice
0 references
possible winner problem
0 references
NP-completeness
0 references
dichotomy
0 references
0 references
0.9054370522499084
0 references
0.9045807719230652
0 references
0.8177517056465149
0 references
0.8154339790344238
0 references
0.8151946067810059
0 references
