Kernelization complexity of possible winner and coalitional manipulation problems in voting (Q906403)
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: Kernelization complexity of possible winner and coalitional manipulation problems in voting |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kernelization complexity of possible winner and coalitional manipulation problems in voting |
scientific article |
Statements
Kernelization complexity of possible winner and coalitional manipulation problems in voting (English)
0 references
21 January 2016
0 references
computational social choice
0 references
possible winner
0 references
voting
0 references
kernelization
0 references
parameterized complexity
0 references
0 references
0.8707342147827148
0 references
0.8083446025848389
0 references
0.8075612187385559
0 references
0.8012875318527222
0 references
