On the complexity of Chamberlin-Courant on almost structured profiles (Q1990291)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of Chamberlin-Courant on almost structured profiles |
scientific article |
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
