On the complexity of Chamberlin-Courant on almost structured profiles (Q1990291)
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: On the complexity of Chamberlin-Courant on almost structured profiles |
scientific article; zbMATH DE number 6964897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of Chamberlin-Courant on almost structured profiles |
scientific article; zbMATH DE number 6964897 |
Statements
On the complexity of Chamberlin-Courant on almost structured profiles (English)
0 references
25 October 2018
0 references
NP-hardness
0 references
Chamberlin Courant
0 references
single-crossing profiles
0 references
single-peaked profiles
0 references
fixed-parameter algorithms
0 references
voting rules
0 references
0.8186295032501221
0 references
0.8132765889167786
0 references
0.8021337389945984
0 references
0.7974892258644104
0 references
0.7960102558135986
0 references
