The complexity of controlling candidate-sequential elections (Q526900)
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: The complexity of controlling candidate-sequential elections |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of controlling candidate-sequential elections |
scientific article |
Statements
The complexity of controlling candidate-sequential elections (English)
0 references
15 May 2017
0 references
computational complexity
0 references
computational social choice
0 references
online algorithms
0 references
online control
0 references
sequential voting
0 references
candidate control of elections
0 references
0 references
0.8791536688804626
0 references
0.8419853448867798
0 references
0.8283684253692627
0 references
0.8276509642601013
0 references
0.8177435994148254
0 references
