False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time (Q5405028)
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 6275996
| 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 6275996 |
Statements
False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time (English)
0 references
31 March 2014
0 references
0 references
0.9390368
0 references
0.9334035
0 references
0.9228145
0 references
0.8736038
0 references
0.8242352
0 references
0.82254857
0 references
0.8182563
0 references
0.81736505
0 references
