Timeline for How to assign a score to items based on a set of partial rankings
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 19, 2010 at 2:49 | answer | added | Steven Pav | timeline score: 1 | |
| May 8, 2010 at 15:41 | comment | added | David R. MacIver | Unfortunately the rankings are not likely to be of the same size - they're probably all going to be of similar size (and small compared to the size of I) though. | |
| May 8, 2010 at 15:37 | comment | added | some guy on the street | If your partial rankings were all the same size, then the ranking score at least seems to be special --- that is, assign the ranking loser a score of 1, the next-up 2, etc.; and then sum over partial rankings. This score seems to be in a special sub-variety of the scoring simplex, which behaves well w.r.t. permutations --- details escape me, but for a Reference, I'm recalling this much as it was in a recent AMS Notices (in the past one or two years, I think). | |
| May 8, 2010 at 15:36 | answer | added | Martin M. W. | timeline score: 1 | |
| May 8, 2010 at 15:22 | history | asked | David R. MacIver | CC BY-SA 2.5 |