Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (Q2103031)
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: Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner |
scientific article; zbMATH DE number 7632170
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner |
scientific article; zbMATH DE number 7632170 |
Statements
Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (English)
0 references
12 December 2022
0 references
group decisions and negotiations
0 references
combinatorial optimization
0 references
computational social choice
0 references
ranking aggregation
0 references
Kemeny method
0 references
0 references
0.82878226
0 references
0.82865936
0 references
0.8236415
0 references
0.8205701
0 references
0.81934005
0 references
0.81823766
0 references
0.8134818
0 references
0.8108978
0 references
0.80889976
0 references
