Efficient algorithms using subiterative convergence for Kemeny ranking problem (Q107991)
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 6902869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms using subiterative convergence for Kemeny ranking problem |
scientific article; zbMATH DE number 6902869 |
Statements
98
0 references
198-210
0 references
October 2018
0 references
12 July 2018
0 references
Efficient algorithms using subiterative convergence for Kemeny ranking problem (English)
0 references
consensus ranking
0 references
heuristics
0 references
Kemeny distance
0 references
Kemeny-Snell distance
0 references
median ranking
0 references
rank aggregation problem
0 references
0 references
0 references
0.8274148106575012
0 references
0.7918276190757751
0 references
0.78836590051651
0 references
0.7708389163017273
0 references
0.770415186882019
0 references
Ashish Das
0 references
