The complexity of manipulative attacks in nearly single-peaked electorates (Q490458)
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 manipulative attacks in nearly single-peaked electorates |
scientific article; zbMATH DE number 6476349
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of manipulative attacks in nearly single-peaked electorates |
scientific article; zbMATH DE number 6476349 |
Statements
The complexity of manipulative attacks in nearly single-peaked electorates (English)
0 references
27 August 2015
0 references
algorithms and complexity
0 references
computational social choice
0 references
election control
0 references
election manipulation
0 references
multiagent systems
0 references
nearly single-peaked preferences
0 references
0 references
0 references
0 references
0.9092490077018738
0 references
0.8939075469970703
0 references
0.8757966756820679
0 references
0.865944504737854
0 references
0.8580042719841003
0 references
