We will discuss about the existence of Pareto solutions for polynomial vector optimization. We establish relationships between the notions of properness, M-tameness, and the Palais--Smale conditions formulated for the restriction of the vector cost mapping on the constraint set. These results are instrumental to derive necessary and sufficient conditions for the existence of Pareto solutions in polynomial vector optimization. Finally, some open questions are discussed.