Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach (Q62323)
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: Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach |
scientific article; zbMATH DE number 6635807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach |
scientific article; zbMATH DE number 6635807 |
Statements
249
0 references
2
0 references
667-676
0 references
March 2016
0 references
7 October 2016
0 references
Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach (English)
0 references
preference rankings
0 references
median ranking
0 references
Kemeny distance
0 references
social choice problem
0 references
branch-and-bound algorithm
0 references
0 references
0 references
