In computational complexity theory, Yao's principle is a way to prove lower bounds on the worst-case performance of randomized algorithms, by comparing them to deterministic algorithms. Wikipedia