False-name manipulation in weighted voting games is hard for probabilistic polynomial time (Q5494857)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6322999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | False-name manipulation in weighted voting games is hard for probabilistic polynomial time |
scientific article; zbMATH DE number 6322999 |
Statements
False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time (English)
0 references
30 July 2014
0 references
0.9849998950958252
0 references
0.9383108019828796
0 references
0.8755047917366028
0 references
0.8604435324668884
0 references
