We characterize he {\em codominance pairs} pairs of posets that admit simultaneous dominance representations in the $(x,y)$- and $(-x,y)$-coordinate systems and present a linear algorithm to recognize them and construct codominance representations. We define {\em dominance polysemy} as a generalization of codominance and describe several related problems and preliminary results.