Faster algorithms for computing plurality points (Q3132866)
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: Faster algorithms for computing plurality points |
scientific article; zbMATH DE number 6832289
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for computing plurality points |
scientific article; zbMATH DE number 6832289 |
Statements
30 January 2018
0 references
computational geometry
0 references
computational social choice
0 references
voting theory
0 references
plurality points
0 references
Condorcet points
0 references
Faster Algorithms for Computing Plurality Points (English)
0 references
0.9961222410202026
0 references
0.8712599277496338
0 references
0.8345837593078613
0 references
0.738278865814209
0 references
0.7349070906639099
0 references
