In combinatorial game theory, you can have infinitesimal games like up={0|*}={0|{0|0}}, and if you are allowed to use expressions that involve themselves as an option, like Off={|Off}, then you can find the smallest positive game: Tiny={0|{0|Off}} in the sense that there is no game that is less than Tiny but greater than 0.
What I want to know is: Is there a game which is in that sense the largest infinitesimal? In other words, does there exist a (infinitesimal) game G such that there is no other game H greater than G but less than all games with a real number value?
Note: There has been some confusion in the answers on what type of combinatorial games I am asking about. I want to know about the largest infinitesimal game out of all combinatorial games, including loopy and transfinite games.
There is no largest infinitesimal game, because if $G$ is a positive infinitesimal game, then $G+G$ is larger, but still infinitesimal.
However, in Chapter 16 of ONAG, in the section "The Gamut Revealed", we learn that the "largest infinitesimal games" are {$\alpha\, |\, \mathbb{R}^+ || \, \mathbb{R}^+\}$ where $\alpha$ is an ordinal. I believe this means that any infinitesimal game is smaller than some game of this form, for some choice of ordinal $\alpha$.