Optimal randomized competitive ratio for online noncrossing matching

Determine the optimal asymptotic competitive ratio achievable by randomized algorithms for online noncrossing matching.

Background

For online noncrossing matching, the paper improves the known randomized lower bound to 0.67034 and proves that no randomized algorithm can have asymptotic competitive ratio greater than 6/7. The exact optimum between these bounds remains unresolved.