I am writing a paper that is meant to establish that certain algorithms rank candidate values accross multiple problems in a different way. To do this, I take Algorithm A and run it on the candidate values and do the same for candidate B. When I run them, I notice that for multiple problems they rank the values as follows:
A B
c1 1 1
c2 2 1
c3 3 1
Is there a metric that can tell me something about how simillar these 2 ranking sets are without saying the correlation is undefined. fyi. I've tried Kendall's tau and it is undefined for the example given and so therefore I am looking for a metric that can tell me something useful in this particular case.