Computational complexity in the design of voting rules (Q256771)
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: Computational complexity in the design of voting rules |
scientific article; zbMATH DE number 6553072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity in the design of voting rules |
scientific article; zbMATH DE number 6553072 |
Statements
Computational complexity in the design of voting rules (English)
0 references
10 March 2016
0 references
computational complexity
0 references
NP-completeness
0 references
simple game
0 references
core
0 references
stability
0 references
Nakamura number
0 references
0.8238438367843628
0 references
0.8181732892990112
0 references
0.8100899457931519
0 references
0.8049227595329285
0 references
0.8024239540100098
0 references
