# Scoring vectors by "distinctness"

I have a set of vectors in a vector space and I'm looking for some score that measures how "distinct" each vector is from the others.

I suppose this is a well-known problem but I have no idea how to call it or how to search for it.

To explain what I mean, suppose the points are some vectors in a vector space (not necessarily 2-dimensional). I'm looking to assign a score to each vector such that the vector which is the most "distinct" (the farthest from the others in some sense) has the highest score. In this example, the yellow vector would probably have the highest score and the red and blue would have the lowest.

In my particular case each vector represents a policy in two-agent reinforcement learning. I'm trying to capture the notion that similar policies would have similar performance when playing against any given agent. In other words, if I keep only a subset of the policies, I should remove those with the lowest score (because the remaining ones form a good representation of the policy space). In the picture above, the blue vector could be removed because the red vector is quite similar.

Is there a name for such a score for vectors in a set? What types of scores exist? Where can I find more information about this topic? I guess I could use some form of clustering but I'm not sure this is the best option.