given a family of graphs $\mathcal{f}$, we define a game called the $\mathcal{f}$-saturation game. in this game, two players mini and max alternate adding edges to an initially empty graph on $n$ vertices, with the only constraint being that neither player can add an edge that creates a subgraph that lies in $\mathcal{f}$. the game ends when no more edges can be added to the graph. mini wishes to end the game as quickly as possible, while max wishes to prolong the game. we let $\textrm{sat}_g(\mathcal{f};n)$ denote the number of edges that are in the final graph when both players play optimally. the $\{c_3\}$-saturation game was the first saturation game to be considered, but the order of magnitude of $\textrm{sat}_g(\{c_3\},n)$ remains unknown. we consider a variant of this game, the $\{c_3,c_5\}$-saturationgame, and we show that the saturation number $\textrm{sat}_g(\{c_3,c_5\};n)$ is quadratic. as time permits we will discuss other games involving odd cycles, such as the $\{c_3,c_5,\ldots,c_{2k+1}\}$-saturation game and the $\{c_5,c_7,\ldots\}$ saturation game.