Optimal randomized comparison sorting
Since your question is: "What is known?" Here's something:

http://arxiv.org/abs/1307.3033

This gives an average case analysis of the Ford-Johnson Algorithm. The expected number of comparisons is $\log n! +cn$ for a surprisingly small constant $c$ (about .05).