On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard (Q5111273)
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: On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard |
scientific article; zbMATH DE number 7204391
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard |
scientific article; zbMATH DE number 7204391 |
Statements
26 May 2020
0 references
computational social choice
0 references
dichotomy
0 references
NP-completeness
0 references
maxflow
0 references
voting
0 references
possible winner
0 references
0 references
0 references
0 references
On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard (English)
0 references
0.8342291712760925
0 references
0.8254658579826355
0 references
0.8213028311729431
0 references
0.8151946067810059
0 references
0.793427586555481
0 references
