We generalize the intuitionistic Hyland-Ong games to a notion of
polarized games allowing games with plays starting by proponent
moves. The usual constructions on games are adjusted to fit this
setting yielding a game model for polarized linear logic with a
definability result. As a consequence this gives a complete game model
for various classical systems: LC, lambda-mu calculus, ... for both
call-by-name and call-by-value evaluations.