A graph \( G \) is said to be well-covered if every maximal independent set of vertices has the same cardinality. A planar (simple) graph in which each face is a quadrilateral is called a (planar) quadrangulation. In the present paper, we characterize those planar quadrangulations which are well-covered.