Timeline for From pairwise comparisons to ranking - python
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 16, 2017 at 9:24 | comment | added | noe | You are right, the inconsistent pairwise rankings would lead to cycles, making the graph cyclic and hence topological sort would not be applicable. Cycles should therefore be resolved before. And you are right that this approach does not care about the actual values of the probabilities, but only if they are above an arbitrary threshold. | |
| May 9, 2017 at 8:50 | comment | added | Stergios | Do you think this would also work in case of inconsistent pairwise rankings e.g. q1> q2, q2>q3 but q3>q1? Also, this ignores the probabilities and just cares about one item being above another one, is that right? | |
| May 8, 2017 at 17:37 | history | answered | noe | CC BY-SA 3.0 |