Two-Fidelity Best-Action Identification for Stochastic Minimax Tree
2FFS is proposed, a two-fidelity tree-search algorithm that brings multi-fidelity flat bandit ideas into trees and proves fixed-confidence correctness, establish finite stopping for exact identification, and give a polynomial-depth cost upper bound for general-depth trees.