Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (Q722093)
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: Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections |
scientific article; zbMATH DE number 6909195
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections |
scientific article; zbMATH DE number 6909195 |
Statements
Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (English)
0 references
20 July 2018
0 references
computational social choice
0 references
voting
0 references
veto election
0 references
control complexity
0 references
0 references
0 references
0 references
0 references
0.9851379990577698
0 references
0.856904923915863
0 references
0.8340947031974792
0 references
0.8282012939453125
0 references
0.8219500184059143
0 references
