We study the algorithmic problem of finding large $γ$-balanced independent sets in dense random bipartite graphs; an independent set is $γ$-balanced if a $γ$ proportion of its vertices lie on one side of the bipartition. In the sparse regime, Perkins and Wang established tight bounds within the low-degree polynomial (LDP) framework, showing a factor-$1/(1-γ)$ statistical-computational gap via the Overlap Gap Property (OGP) framework tailored for stable algorithms. However, these techniques do not appear to extend to the dense setting. For the related large independent set problem in dense random graph, the best known algorithm is an online greedy procedure that is inherently unstable, and LDP algorithms are conjectured to fail even in the "easy" regime where greedy succeeds. We show that the largest $γ$-balanced independent set in dense random bipartite graphs has size $α:=\frac{\log_b n}{γ(1-γ)}$ whp, where $n$ is the size of each bipartition, $p$ is the edge probability, and $b=1/(1-p)$. We design an online algorithm that achieves $(1-ε)(1-γ)α$ whp for any $ε>0$. We complement this with a sharp lower bound, showing that no online algorithm can achieve $(1+ε)(1-γ)α$ with nonnegligible probability. Our results suggest that the same factor-$1/(1-γ)$ gap is also present in the dense setting, supporting its conjectured universality. While the classical greedy procedure on $G(n,p)$ is straightforward, our algorithm is more intricate: it proceeds in two stages, incorporating a stopping time and suitable truncation to ensure that $γ$-balancedness-a global constraint-is met despite operating with limited information. Our lower bound utilizes the OGP framework; we build on a recent refinement of this framework for online models and extend it to the bipartite setting.