A Budget-Feasible Reformulation of SmartDCA

January 12, 2026 (1w ago)

Abstract

Calvet, Herranz-Celotti, and Valimamode propose SmartDCA, a family of rules that adapt periodic purchases to the current price level and prove, without market assumptions, that SmartDCA improves the (unit-weighted) average acquisition price relative to standard Dollar-Cost Averaging (DCA) [1]. In this note we introduce a budget-feasible framework that enforces a basic constraint inherent to DCA-style investing: the amount invested at each date cannot exceed the cash available from scheduled contributions and accumulated uninvested balances. We formalize two variants: a static cap (no reallocation of withheld cash) and a dynamic cash-account model (carry-over). These definitions are intended to separate (i) improvements in average acquisition price from (ii) statements about terminal wealth when uninvested cash is explicitly accounted for.

1. Background: DCA and SmartDCA

Fix a discrete time grid t=1,,Tt = 1, \ldots, T. Let (pt)t=1T(p_t)_{t=1}^T be the strictly positive price process of a single risky asset. A DCA investor contributes a constant cash flow cb>0c_b > 0 at each date and invests it immediately, i.e.,

ctDCA:=cb,t=1,,T,c_t^{\text{DCA}} := c_b, \quad t = 1, \ldots, T,

purchasing qtDCA:=cb/ptq_t^{\text{DCA}} := c_b/p_t units at time tt.

In [1], SmartDCA modifies the invested amount as a function of the relative price level. Let pr>0p_r > 0 denote a reference price (e.g., a fixed anchor or a moving average), and define rt:=pr/ptr_t := p_r/p_t. A generic (possibly unbounded) SmartDCA rule can be written as

ctS:=cbϕ(rt),ϕ(r)0,(1)c_t^S := c_b \, \phi(r_t), \quad \phi(r) \geq 0, \tag{1}

including the ρ\rho-SmartDCA class ϕ(r)=f(r)ρ\phi(r) = f(r)^\rho with ρ0\rho \geq 0 as studied in [1]. The paper focuses on the average acquisition price

μ:=t=1Tctt=1Tct/pt,\mu := \frac{\sum_{t=1}^T c_t}{\sum_{t=1}^T c_t/p_t},

and establishes (under mild conditions on ϕ\phi) that SmartDCA attains a lower μ\mu than DCA without any probabilistic assumption on the path (pt)(p_t) [1].

Motivation for a budget-feasible reformulation. Rule (1) allows ctc_t to exceed the periodic contribution cbc_b, which implicitly assumes access to additional liquidity (borrowing or an external cash reserve not modeled). To align with the DCA principle "invest at most what is available from contributions and accumulated cash", we introduce explicit cash accounting and admissibility constraints.

2. Model: Terminal wealth with explicit cash accounting

We define the number of units purchased at time tt by

qt:=ctpt,t=1,,T,q_t := \frac{c_t}{p_t}, \quad t = 1, \ldots, T,

and the cumulative risky holdings by QT:=t=1TqtQ_T := \sum_{t=1}^T q_t. We track uninvested cash through a (nonnegative) cash balance process (Bt)t=1T+1(B_t)_{t=1}^{T+1}. Throughout this note (unless stated otherwise) we take the cash account to have zero interest; an extension with a deterministic risk-free rate is straightforward.

The terminal wealth is defined as

VT:=pTQT+BT+1=pTt=1Tctpt+BT+1.(2)V_T := p_T Q_T + B_{T+1} = p_T \sum_{t=1}^T \frac{c_t}{p_t} + B_{T+1}. \tag{2}

This definition makes the comparison between strategies well-posed even when investment schedules differ: the uninvested portion of contributions remains part of wealth via BT+1B_{T+1}.

3. Budget-feasible SmartDCA: no carry-over

The simplest way to enforce "do not invest more than the periodic contribution" is the pointwise constraint

0ctcb,t=1,,T.(3)0 \leq c_t \leq c_b, \quad t = 1, \ldots, T. \tag{3}

A capped SmartDCA rule can be represented by choosing ϕ\phi in (1) such that ϕ(r)[0,1]\phi(r) \in [0, 1] for all r>0r > 0, yielding

ctcap:=cbϕ(rt)cb.c_t^{\text{cap}} := c_b \, \phi(r_t) \leq c_b.

In this section, "no carry-over" means that any withheld amount (cbct)(c_b - c_t) is not reinvested at later dates and remains in cash until TT (in the zero-rate case). Thus,

VTcap=pTt=1Tctpt+t=1T(cbct).(4)V_T^{\text{cap}} = p_T \sum_{t=1}^T \frac{c_t}{p_t} + \sum_{t=1}^T (c_b - c_t). \tag{4}

By contrast, DCA satisfies ct=cbc_t = c_b and hence BT+1=0B_{T+1} = 0 and

VTDCA=pTt=1Tcbpt.(5)V_T^{\text{DCA}} = p_T \sum_{t=1}^T \frac{c_b}{p_t}. \tag{5}

3.1 SmartDCA does not guarantee higher terminal wealth

We now show that, under the static cap (3), capped SmartDCA does not dominate DCA in terms of terminal wealth in a pathwise sense.

Theorem 3.1 (No pathwise wealth dominance under a static cap). Assume the static budget cap (3) and consider the capped schedule ct=cbϕ(rt)c_t = c_b \, \phi(r_t) with ϕ(rt)[0,1]\phi(r_t) \in [0, 1] for all tt. Then capped SmartDCA does not guarantee a higher terminal wealth than DCA: there exist price paths (pt)t=1T(p_t)_{t=1}^T for which

VTcap<VTDCA,V_T^{\text{cap}} < V_T^{\text{DCA}},

and there also exist price paths for which VTcap>VTDCAV_T^{\text{cap}} > V_T^{\text{DCA}}.

Proof. Define the terminal-wealth difference

ΔVT:=VTcapVTDCA=(pTt=1Tctpt+t=1T(cbct))pTt=1Tcbpt.\Delta V_T := V_T^{\text{cap}} - V_T^{\text{DCA}} = \left( p_T \sum_{t=1}^T \frac{c_t}{p_t} + \sum_{t=1}^T (c_b - c_t) \right) - p_T \sum_{t=1}^T \frac{c_b}{p_t}.

Rearranging terms yields

ΔVT=pTt=1Tctcbpt+t=1T(cbct)=t=1T(cbct)(1pTpt).\Delta V_T = p_T \sum_{t=1}^T \frac{c_t - c_b}{p_t} + \sum_{t=1}^T (c_b - c_t) = \sum_{t=1}^T (c_b - c_t) \left( 1 - \frac{p_T}{p_t} \right).

Using ct=cbϕ(rt)c_t = c_b \, \phi(r_t), we obtain the factorization

ΔVT=cbt=1T(1ϕ(rt))(1pTpt).(6)\Delta V_T = c_b \sum_{t=1}^T \bigl(1 - \phi(r_t)\bigr) \left( 1 - \frac{p_T}{p_t} \right). \tag{6}

Since ϕ(rt)[0,1]\phi(r_t) \in [0, 1], we have (1ϕ(rt))0\bigl(1 - \phi(r_t)\bigr) \geq 0 for every tt, hence the sign of each summand in (6) is entirely determined by the factor (1pTpt)\left(1 - \frac{p_T}{p_t}\right).

If we select a price path such that the terminal price is the maximum along the path, i.e., pT=max1tTptp_T = \max_{1 \leq t \leq T} p_t, then pTpt1\frac{p_T}{p_t} \geq 1 for all tt, hence (1pTpt)0\left(1 - \frac{p_T}{p_t}\right) \leq 0 for all tt, and therefore ΔVT0\Delta V_T \leq 0. Moreover, the inequality is strict as soon as there exists at least one date tt for which ϕ(rt)<1\phi(r_t) < 1 and pt<pTp_t < p_T, in which case VTcap<VTDCAV_T^{\text{cap}} < V_T^{\text{DCA}}.

Conversely, if we select a price path such that the terminal price is the minimum along the path, i.e., pT=min1tTptp_T = \min_{1 \leq t \leq T} p_t, then pTpt1\frac{p_T}{p_t} \leq 1 for all tt, hence (1pTpt)0\left(1 - \frac{p_T}{p_t}\right) \geq 0 for all tt, and thus ΔVT0\Delta V_T \geq 0, with strict inequality under the analogous non-degeneracy condition.

Hence there exist price paths for which capped SmartDCA underperforms DCA in terminal wealth, and price paths for which it outperforms, proving the claim. \square

Interpretation. Under the static cap, capped SmartDCA systematically holds back a nonnegative cash amount cbctc_b - c_t relative to DCA. Equation (6) shows that this cash retention helps precisely when the terminal price is relatively low compared to past prices (so that delaying purchases is beneficial), and hurts when the terminal price is relatively high (so that earlier exposure would have been preferable). In particular, the improvement in average acquisition price established in [1] does not translate into a pathwise guarantee of higher terminal wealth once the cash component is made explicit.

This result already shows that improvements in average acquisition prices do not imply pathwise dominance in terminal wealth under a static budget cap.

4. Budget-feasible SmartDCA: carry-over

A more faithful representation of periodic investing with liquidity constraints is to allow cash carry-over. Let BtB_t denote the cash balance just before investing at time tt, with initial condition B1=0B_1 = 0. After receiving the contribution cbc_b, the investor allocates ctc_t to the asset, subject to the admissibility constraint

0ctBt+cb,t=1,,T,(7)0 \leq c_t \leq B_t + c_b, \quad t = 1, \ldots, T, \tag{7}

and updates the cash balance as

Bt+1=Bt+cbct,t=1,,T.(8)B_{t+1} = B_t + c_b - c_t, \quad t = 1, \ldots, T. \tag{8}

The pair (7)-(8) rules out leverage and explicitly models the funding source of purchases. Standard DCA corresponds to ct=cbc_t = c_b for all tt and yields Bt0B_t \equiv 0.

Given a target SmartDCA schedule c~t:=cbϕ(rt)\tilde{c}_t := c_b \, \phi(r_t), a canonical budget-feasible implementation is the projection

ct:=min{c~t,Bt+cb},(9)c_t := \min\{\tilde{c}_t, B_t + c_b\}, \tag{9}

where BtB_t is generated by (8). The resulting wealth is still given by (2).

4.1 A structural decomposition of terminal wealth

We first derive an identity that makes explicit what the carry-over constraint can and cannot achieve.

Theorem 4.1 (Carry-over SmartDCA is a rescheduling rule). Assume (7)-(8) with B1=0B_1 = 0 and a zero-interest cash account. Then the terminal wealth admits the decomposition

VT=cbTtotal contributed cash+t=1Tct(pTpt1)value added by the investment schedule,(10)V_T = \underbrace{c_b \, T}_{\text{total contributed cash}} + \underbrace{\sum_{t=1}^T c_t \left( \frac{p_T}{p_t} - 1 \right)}_{\text{value added by the investment schedule}}, \tag{10}

and satisfies the pathwise bound

VTcbTcbt=1TtpTpt1.(11)\bigl| V_T - c_b \, T \bigr| \leq c_b \sum_{t=1}^T t \left| \frac{p_T}{p_t} - 1 \right|. \tag{11}

Proof. Starting from the definition of terminal wealth,

VT=pTt=1Tctpt+BT+1,V_T = p_T \sum_{t=1}^T \frac{c_t}{p_t} + B_{T+1},

and using the cash dynamics (8) with B1=0B_1 = 0, we obtain

BT+1=t=1T(cbct).B_{T+1} = \sum_{t=1}^T (c_b - c_t).

Hence

VT=pTt=1Tctpt+t=1T(cbct)=t=1T(pTctpt+cbct)=cbt=1T1+t=1Tct(pTpt1),V_T = p_T \sum_{t=1}^T \frac{c_t}{p_t} + \sum_{t=1}^T (c_b - c_t) = \sum_{t=1}^T \left( \frac{p_T c_t}{p_t} + c_b - c_t \right) = c_b \sum_{t=1}^T 1 + \sum_{t=1}^T c_t \left( \frac{p_T}{p_t} - 1 \right),

which yields (10). To emphasize the economics of the decomposition, one may view each summand as

pTctpt+(cbct)=cbperiod-t contribution+ct(pTpt1)increment due to investing at t.\frac{p_T c_t}{p_t} + (c_b - c_t) = \underbrace{c_b}_{\text{period-}t\text{ contribution}} + \underbrace{c_t \left( \frac{p_T}{p_t} - 1 \right)}_{\text{increment due to investing at }t}.

We now prove the bound (11). By the admissibility constraint (7),

0ctBt+cb.0 \leq c_t \leq B_t + c_b.

Moreover, since B1=0B_1 = 0 and Bt+1=Bt+cbctB_{t+1} = B_t + c_b - c_t with ct0c_t \geq 0, we have the crude pathwise upper bound

Bt(t1)cb,t=1,,T,B_t \leq (t - 1)c_b, \quad t = 1, \ldots, T,

because the cash balance cannot exceed the cumulative contributions received up to time t1t - 1. Therefore

ctBt+cb(t1)cb+cb=tcb.c_t \leq B_t + c_b \leq (t - 1)c_b + c_b = t \, c_b.

Taking absolute values in (10) gives

VTcbT=t=1Tct(pTpt1)t=1TctpTpt1cbt=1TtpTpt1,\bigl| V_T - c_b T \bigr| = \left| \sum_{t=1}^T c_t \left( \frac{p_T}{p_t} - 1 \right) \right| \leq \sum_{t=1}^T c_t \left| \frac{p_T}{p_t} - 1 \right| \leq c_b \sum_{t=1}^T t \left| \frac{p_T}{p_t} - 1 \right|,

which is (11). \square

Interpretation. Identity (10) shows that, once the contribution stream (cb)t=1T(c_b)_{t=1}^T is fixed and leverage is excluded, any budget-feasible SmartDCA rule can only affect terminal wealth through the timing of purchases encoded by (ct)t=1T(c_t)_{t=1}^T. The baseline cbTc_b T corresponds to the terminal value of "keeping all contributions in cash" (at zero rate), while the second term captures the incremental gain (or loss) from converting part of the cash into the risky asset at different dates and holding it to TT.

The bound (11) provides a pathwise control on how far terminal wealth can deviate from the full-cash baseline under (7)-(8). In particular, the deviation is jointly limited by (i) the liquidity constraint, which implies cttcbc_t \leq t \, c_b, and (ii) the realized relative price changes pT/ptp_T/p_t. In this sense, carry-over SmartDCA should be interpreted as a rescheduling mechanism for exposure rather than a construction that can guarantee systematic outperformance in terminal wealth without additional assumptions on the price path.

Remark (risk-free rate). The preceding constructions extend immediately to the case where uninvested cash earns a deterministic per-period risk-free rate r0r \geq 0. In the carry-over (dynamic) setting, (8) is replaced by

Bt+1=(1+r)(Bt+cbct),B_{t+1} = (1 + r)(B_t + c_b - c_t),

while in the static-cap setting the cash term in (4) becomes the time-TT value of the retained amounts, e.g.

t=1T(cbct)(1+r)Tt\sum_{t=1}^T (c_b - c_t)(1 + r)^{T-t}

under discrete compounding. All identities and comparisons remain of the same nature: introducing rr changes the algebraic form of the cash component but does not alter the qualitative message of this note—once cash is explicitly accounted for, capped/budget-feasible SmartDCA primarily modifies investment timing rather than providing a pathwise guarantee of higher terminal wealth relative to DCA.

5. Conclusion

This note revisits SmartDCA through the lens of budget feasibility, i.e. under the basic operational constraint that the invested amount at each date cannot exceed the investor's available cash. We formalized two natural implementations: a static cap (no reallocation of withheld cash) and a dynamic cash-account model (carry-over). In both settings, making the cash component explicit leads to simple decompositions of terminal wealth that clarify what SmartDCA can and cannot guarantee. In particular, while SmartDCA can improve the average acquisition price as established in [1], this improvement does not translate into a pathwise dominance of terminal wealth over standard DCA once liquidity constraints and retained cash are accounted for. Under budget feasibility, SmartDCA should therefore be interpreted primarily as a rescheduling rule that changes the timing of exposure rather than a construction ensuring systematic wealth outperformance without additional assumptions on the price path.

Acknowledgements

I am grateful to Vincent Tena (Universite Paris Dauphine-PSL) and Vincent Danos (CNRS, ENS-PSL) for carefully reading earlier versions of this note and for their helpful comments and corrections.

References

[1] Emmanuel Calvet, Luca Herranz-Celotti, and Karim Valimamode. SmartDCA superiority. arXiv:2308.05200, 2023. doi:10.48550/arXiv.2308.05200.