TSSort: Probabilistic Noise Resistant Sorting

TL;DR

TSSort is a probabilistic sorting algorithm based on TrueSkill that converges quickly and resists noise, making it effective for noisy or expensive comparisons.

Contribution

It introduces a novel combination of TrueSkill with a new pair selection strategy for efficient, noise-resistant sorting.

Findings

Outperforms standard algorithms in convergence speed

Demonstrates robustness to noisy comparisons

Effective in scenarios with expensive comparisons

Abstract

In this paper we present TSSort, a probabilistic, noise resistant, quickly converging comparison sort algorithm based on Microsoft TrueSkill. The algorithm combines TrueSkill's updating rules with a newly developed next item pair selection strategy, enabling it to beat standard sorting algorithms w.r.t. convergence speed and noise resistance, as shown in simulations. TSSort is useful if comparisons of items are expensive or noisy, or if intermediate results shall be approximately ordered.