K-Medoids / K-Means Algorithm. Data point with the equal distances between two or more cluster representatives

Question

I have been researching and studying about partition-based clustering algorithms like K-means and K-Medoids. I have learned that K-medoids is more robust to outliers compared to

Answer 1

To prevent bad things from happening (infinite loops etc.) always prefer the cluster the point already is assigned to when tied.