Approximation and parameterized complexity of minimax approval voting (Q4558792)
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: Approximation and parameterized complexity of minimax approval voting |
scientific article; zbMATH DE number 6987099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation and parameterized complexity of minimax approval voting |
scientific article; zbMATH DE number 6987099 |
Statements
Approximation and Parameterized Complexity of Minimax Approval Voting (English)
0 references
30 November 2018
0 references
compitational speed
0 references
computational social choice
0 references
approximation
0 references
0.8657354712486267
0 references
0.7583950161933899
0 references
0.7295519113540649
0 references
0.7286293506622314
0 references
0.7265966534614563
0 references
