I don't have an answer to the one-variable decision
question that you asked.

But you did introduce multi-variable
expressions, and there are some fascinating results on the
multi-variable analogue of your domination problem.
(Perhaps you know all this already...) That is, given two rational
exponential expressions f(x_{1},...,x_{k})
and
f(x_{1},...,x_{k}), the problem is to decide whether
f(n_{1},...,n_{k}) <=
g(n_{1},...,n_{k}), for all positive integers (n_{1},...,n_{k}) except at most
finitely often.

The answer is that this decision problem is undecidable,
and it is undecidable even for polynomial expressions.
There is no algorithm that will tell you when one
multi-variable (positive) polynomial expression eventually
dominates another.

The reason is that the decision problem of
Diophantine equations
is encodable into this domination problem. That work
famously shows that the problem to decide if a given
integer polynomial p(x_{1},...,x_{k}) has
a zero in the integers is undecidable. This is the famous
MRDP solution to Hilbert's 10th
problem.

It is easy to reduce the Diophantine problem to the
domination problem, as follows. First, let us restrict to
non-negative integers, for which the MRDP results still
apply. Suppose we are given a polynomial
p(x_{1},...,x_{k}) expression over the
integers, and want to decide if it has a solution in the
natural numbers. This expression may involve some minus
signs, which your expressions do not allow, but we will
take care of that by moving all the minus signs to one
side. Introduce a new variable x_{0} and consider
the domination problem:

- Does 1 <=
(1+n
_{0})p(n_{1},...,n_{k})^{2} for
all natural numbers except finitely often?

We can expand the right hand side, and move the negative
signs to the left, to arrive at an instance of your
domination problem, using only positive polynomials. Now,
if p(n_{1},...,n_{k}) is never 0, then the
answer to the stated domination problem is Yes, since the
right hand side will always be at least 1 in this case.
Conversely, if p(n_{1},...,n_{k}) = 0 has
a solution, then we arrive at infinitely many violations of
domination by using any choice of n_{0}. Thus, if
we could decide the domination problem, then we could
decide whether p(n_{1},...,n_{k}) = 0 has
solutions in the natural numbers, which we cannot do by the
MRDP theorem. QED

I think the best situation with the Diophantine equations
is that it remains undecidable with nine variables, and so
the domination problem I described above is undecidable
with ten variables. (Perhaps Bjorn Poonen will show up here
and tell us a better answer?)

Of course, this doesn't answer the one-variable question
that you asked, and probably you know all this already.

My final remark is that if one can somehow represent the
inverse pairing function, then one will get undecidability
even in the one variable case. That is, let f(n,m) =
(n+m)(n+m+1)/2 + m be one of the usual pairing functions,
which is bijective between ω^{2} and ω.
Let p be the function such that p(f(n,m)) = n, the
projection of the pairs onto the first coordinate. If the
expressions are enriched to allow p, then one can in effect
work with several variables by coding them all via pairing
into one variable, and in this case, the domination problem
in the one-variable case, for rational exponential
expressions also allowing the function p, will be
undecidable. It would seem speculative to suppose that p is
itself equivalent to a rational exponential expression, but
do you know this?