# Complexity of finding the smallest well-covered completion

I just posted a new question on cstheory.stackexchange.com: how hard is it to find the smallest well-covered graph containing a given graph G as an induced subgraph? I suspect the answer is that it's \( \Sigma_2 \)-complete, but I don't know of a proof.