The domination number $��(G)$ of a graph $G$, its exponential domination number $��_e(G)$, and its porous exponential domination number $��_e^*(G)$ satisfy $��_e^*(G)\leq ��_e(G)\leq ��(G)$. We contribute results about the gaps in these inequalities as well as the graphs for which some of the inequalities hold with equality. Relaxing the natural integer linear program whose optimum value is $��_e^*(G)$, we are led to the definition of the fractional porous exponential domination number $��_{e,f}^*(G)$ of a graph $G$. For a subcubic tree $T$ of order $n$, we show $��_{e,f}^*(T)=\frac{n+2}{6}$ and $��_e(T)\leq 2��_{e,f}^*(T)$. We characterize the two classes of subcubic trees $T$ with $��_e(T)=��_{e,f}^*(T)$ and $��(T)=��_e(T)$, respectively. Using linear programming arguments, we establish several lower bounds on the fractional porous exponential domination number in more general settings.