I am sure the solution to this is easy, but I can't work it out.
Suppose we have an extremely simple game: There is only 1 player, who announces a number in the set [0,1]. His payoff is equal to his announcement, unless he announces 1, when his payoff is zero.
What is the Nash? It seems like it should be 1-$\epsilon$, for some arbitrarily small positive $\epsilon$, but then the player can surely improve by increasing his announcement by $\frac{\epsilon}{2}$.
If you think there must be 2 players for there to be a Nash, the following game has the equivalent problem: 2 players, who announce a number in the set [0,1], and their payoffs are equal to their own announcement unless they both announce 1, when both their payoffs are zero.

Indeed, a game theoretic problem requires strategic interaction, i.e., two players. The problem you pose is a decision theoretic problem ("player against nature").
If we were to apply the Nash equilibrium concept anyway, then your reasoning is exactly right: there is no Nash equilibrium in this "game", because there is no action that maximizes the payoff (i.e., you can always find a deviation that increases the payoff). The payoff function is $$p(x)=\begin{cases} x & \text{if }x\in[0,1) \\ 0 & \text{else}, \end{cases}$$ and the discontinuity implies there is no maximum.
If the action space where discrete rather than continuous in $[0,1]$, then there would be a "Nash-equilibrium", by choosing the smallest increment below 1.