Takeaways: We provide a polynomial-time algorithm that efficiently identifies and removes dominant actions in incomplete-information games, reducing the game size in the preprocessing stage for Nash equilibrium calculations. This can contribute to improving the efficiency of Nash equilibrium calculations. We demonstrate its applicability to real-world games (e.g., poker).