We extend the theory of circular game chromatic numbers to signed graphs by defining the invariant $χ_c^g(G,σ)$ for signed graphs $(G,σ)$. Our analysis establishes tight bounds dependent on the structural properties of the underlying graph $G$ and its signature $σ$. Building on the foundational framework of Lin and Zhu \cite{LinZhu2009}, we demonstrate that the circular game chromatic number of a balanced signed graph $(G, σ)$ equals that of its underlying graph $G$, i.e., $χ_c^g(G,σ) = χ_c^g(G)$. For antibalanced signed graphs, we prove that $χ_c^g(G,σ)$ does not exceed the chromatic number of $G$ plus one, with tightness demonstrated for odd cycles. A dichotomy emerges for bipartite graphs: $χ_c^g(G,σ)$ equals $2$ when the graph is balanced, and otherwise remains bounded above by $3$. These results rely on switching equivalence principles (Lemma \ref{lem:Zaslavsky}) and critical properties of fundamental cycles (Lemma \ref{lem:ForcingTree}), adapting classical techniques from unsigned graph theory to the signed context. We further highlight open questions regarding computational complexity and planar graph extensions, creating new bridges between combinatorial game theory and signed graph structural analysis.