Deterministic Budget Allocation

• Deterministic budget allocation is a set of constrained optimization techniques that assign limited resources using fixed rules rather than randomization.
• It spans applications from simulation-based selection and adaptive marketing to online ad bidding, procurement, and network interventions.
• The methods integrate fully deterministic policies or deterministic layers within stochastic frameworks to ensure consistent decision-making under budget constraints.

Deterministic budget allocation is treated in the cited literature as the problem of assigning a limited budget through a rule that is fixed by optimization, thresholding, dynamic programming, or mechanism design, rather than by deliberate randomization. This synthesis suggests that the term does not denote a single formal model. Instead, it appears in fixed-budget simulation-based optimization, response-model-based marketing allocation, online allocation with deterministic inner optimizers, strategyproof procurement, social-network intervention, ranking manipulation, and fair allocation with perishability (Jia, 2012, Zhao et al., 2019, Balkanski et al., 2021, Fazeli et al., 2014). In some papers the entire policy is deterministic, while in others the deterministic object is only the allocation step conditional on posterior samples, confidence bounds, or current estimates (Pillai, 28 Apr 2026, Ge et al., 2024, Montanari et al., 6 Feb 2026).

1. Formal scope and recurring mathematical structures

A recurring structure is a constrained optimization of the form “maximize performance subject to a budget equation or inequality.” In fixed-budget ranking and selection, the budget is split as $N_i=w_iT$ with $w_i\ge 0$ and $\sum_i w_i=1$, and the objective is to maximize the probability of correct selection $\mathrm{PCS}=\Pr(\hat b=b)$ (Cao et al., 2023). In simulation-based optimization with stochastic simulation time, one allocates $T_1,\ldots,T_k$ under $\sum_{i=1}^k T_i=T$ to maximize the probability of correctly selecting the best design (Jia, 2012). In online advertising, users arrive sequentially and decisions $a_t\in\{0,1\}$ must satisfy $\sum_{t=1}^{T} a_t c_t \le B$ (Pillai, 28 Apr 2026). In simplex-style resource allocation, the feasible set is $x^{(i)}\in[0,1]$ with $\sum_i x^{(i)}=1$ (Achddou et al., 2022). In budget-feasible procurement, feasibility is expressed as $w_i\ge 0$0 (Balkanski et al., 2021).

The literature also separates several meanings of “deterministic.” One meaning is a fully deterministic policy or mechanism, such as a descending clock auction, a direct-search rule, or a Bellman-optimal control law (Balkanski et al., 2021, Achddou et al., 2022, Rey et al., 2017). A second meaning is a deterministic allocation layer inside an otherwise stochastic learning system: BCCB uses Thompson sampling but applies a deterministic threshold rule once the sampled exploration term is fixed, multi-task combinatorial bandits solve a deterministic multiple-choice knapsack problem after sampling reward parameters, and RA-UCB solves a deterministic optimistic allocation problem from confidence bounds (Pillai, 28 Apr 2026, Ge et al., 2024, Montanari et al., 6 Feb 2026). This suggests that determinism is often a property of the decision map, not necessarily of the information state that feeds it.

2. Fixed-budget computing allocation and ranking-and-selection

The most direct deterministic budget-allocation results in the cited material arise in ranking-and-selection and simulation-based optimization. For a finite set of competing designs, the classical OCBA logic allocates more budget to alternatives that are harder to distinguish from the current best, typically those with small estimated performance gaps and large output variance. When simulation time is stochastic, the paper on OCBAS shows that, asymptotically, only the mean simulation time $w_i\ge 0$1 matters, because $w_i\ge 0$2 and the posterior distribution can be approximated by

$w_i\ge 0$3

This leads to the stochastic-time allocation rule

$w_i\ge 0$4

with the best design receiving

$w_i\ge 0$5

The resulting sequential method, OCBAS, is stated to be asymptotically optimal, and the numerical studies further report that deterministic-time OCBA is robust even when simulation time is random (Jia, 2012).

A distinct finite-budget correction appears in the budget-adaptive OCBA paper. There the asymptotic OCBA rule is recovered from a large-budget limit, but the main contribution is a budget-adaptive rule for finite $w_i\ge 0$6. The paper writes the finite-budget allocation as

$w_i\ge 0$7

where $w_i\ge 0$8 is the asymptotic OCBA weight and $w_i\ge 0$9 is a budget-dependent correction. The ordering

$\sum_i w_i=1$0

implies that designs easy to distinguish from the best are boosted, while hard-to-distinguish designs are discounted relative to asymptotic OCBA. The paper then proposes FAA and DAA as sequential heuristics built around this rule and reports higher PCS than OCBA and equal allocation in its experiments (Cao et al., 2023).

When the input distribution is itself learned from streaming data, deterministic allocation moves from design level to design-input-pair level. The stage-wise problem in data-driven ranking and selection chooses $\sum_i w_i=1$1 to maximize the large-deviations decay rate of false selection. The rate function is

$\sum_i w_i=1$2

and the optimal allocation is characterized by input balance, total balance, and local balance. In particular,

$\sum_i w_i=1$3

and

$\sum_i w_i=1$4

The proposed DD-OCBA-approx and DD-OCBA-balance procedures are proved consistent and asymptotically optimal (Wang et al., 2022).

3. Forecast-and-optimize allocation in marketing and resource optimization

A second major line of work treats deterministic budget allocation as an optimization problem over learned response surfaces. In the unified marketing framework, segment-level response is modeled by the logit demand curve

$\sum_i w_i=1$5

and budget allocation is posed as

$\sum_i w_i=1$6

By changing variables from costs $\sum_i w_i=1$7 to market shares $\sum_i w_i=1$8, the paper obtains a strongly convex constraint function and reduces the continuous problem to a one-dimensional root-finding problem in the dual variable $\sum_i w_i=1$9. The optimal $\mathrm{PCS}=\Pr(\hat b=b)$0 is expressed באמצעות the Lambert $\mathrm{PCS}=\Pr(\hat b=b)$1 function, and a bisection algorithm solves the resulting deterministic allocation problem in $\mathrm{PCS}=\Pr(\hat b=b)$2 per iteration. The same framework supports cost upper bounds, profit lower bounds, ROI lower bounds, and discrete settings through a reduction to multiple-choice knapsack (Zhao et al., 2019).

Direct-search methods provide a different deterministic formulation. In blind resource allocation, the feasible domain is $\mathrm{PCS}=\Pr(\hat b=b)$3, with the simplex as the resource-allocation specialization. Pattern search evaluates feasible trial points $\mathrm{PCS}=\Pr(\hat b=b)$4, accepts the first one that yields sufficient decrease $\mathrm{PCS}=\Pr(\hat b=b)$5, and otherwise shrinks the step size. Under smoothness, strong convexity, and the cosine-measure condition on the direction set, the deterministic unconstrained version has finite cumulative regret, i.e., a constant upper bound that does not grow with $\mathrm{PCS}=\Pr(\hat b=b)$6 (Achddou et al., 2022).

Retrospective auditing reframes deterministic allocation as ex post evaluation rather than ex ante construction. In the hindsight-regret framework, a realized spend trajectory $\mathrm{PCS}=\Pr(\hat b=b)$7 is compared with a constraint-faithful benchmark $\mathrm{PCS}=\Pr(\hat b=b)$8 that satisfies the same budget and stability guardrails. Regret is

$\mathrm{PCS}=\Pr(\hat b=b)$9

and the paper propagates uncertainty through Monte Carlo to report regret distributions, expected regret, credible intervals, and $T_1,\ldots,T_k$0. The experiments report a trade-off between flexibility and detectability, and suggest that allowing roughly $T_1,\ldots,T_k$1 to $T_1,\ldots,T_k$2 inter-epoch movement captures many of the improvements while larger reallocations move into weak-support regions with higher uncertainty (Pathak et al., 28 Apr 2026).

4. Deterministic inner rules inside online learning systems

Several recent online-allocation papers are explicitly not deterministic overall, but they isolate deterministic allocation subroutines. BCCB in online advertising is a hybrid stochastic sequential policy: it samples $T_1,\ldots,T_k$3 and $T_1,\ldots,T_k$4, forms

$T_1,\ldots,T_k$5

computes budget pressure

$T_1,\ldots,T_k$6

and then applies the deterministic gating rule

$T_1,\ldots,T_k$7

together with the hard budget check $T_1,\ldots,T_k$8. The paper does not claim deterministic optimality or theorem-backed budget-feasibility guarantees, but it makes the deterministic pacing and threshold logic central to the policy design (Pillai, 28 Apr 2026).

The multi-task combinatorial bandit formulation of campaign budgeting has the same split. Reward parameters are learned through a Bayesian hierarchical model and Thompson sampling, but once sampled rewards $T_1,\ldots,T_k$9 are available, the allocation is the deterministic argmax

$\sum_{i=1}^k T_i=T$0

over the combinatorial action space $\sum_{i=1}^k T_i=T$1. The paper casts this inner problem as a multiple-choice knapsack problem and notes that dynamic programming can solve it (Ge et al., 2024).

RA-UCB goes further toward a deterministic adaptive allocator. For known per-round budget $\sum_{i=1}^k T_i=T$2, it estimates unknown parameters from censored feedback, builds optimistic and pessimistic confidence bounds, and solves

$\sum_{i=1}^k T_i=T$3

through an optimistic surrogate. The resulting allocation is deterministic conditional on the estimates and tie-breaking rule. When the budget is unknown until the round unfolds, MG-UCB implements the same principle by greedy water-filling with infinitesimal allocations, and the paper proves that MG-UCB matches the allocation RA-UCB would have made if the realized budget were known in advance (Montanari et al., 6 Feb 2026).

5. Structural limits, competitive guarantees, and mechanism design

The literature also establishes sharp limits on what deterministic allocation can achieve. In budget-oblivious online Adwords with unknown budgets, every deterministic algorithm has competitive ratio at most $\sum_{i=1}^k T_i=T$4, even on instances with binary bids and large budgets. Greedy attains $\sum_{i=1}^k T_i=T$5, and the paper presents a randomized algorithm with guarantee at least $\sum_{i=1}^k T_i=T$6, showing that randomization is necessary to exceed the deterministic barrier in that model (Udwani, 2021). In the multi-budget ADWORDS generalization, arbitrary overlapping budget sets admit no constant competitive ratio, whereas laminar budgets recover the small-bids ratio $\sum_{i=1}^k T_i=T$7, matching the best known single-budget result of Buchbinder, Jain, and Naor (Kell et al., 2016).

For divisible resources with strategic users and hard budget constraints, the efficiency benchmark changes from social welfare to liquid welfare,

$\sum_{i=1}^k T_i=T$8

Under this benchmark, the Kelly proportional-allocation mechanism $\sum_{i=1}^k T_i=T$9 with pay-your-signal payments has a tight liquid price of anarchy of $a_t\in\{0,1\}$0, and every $a_t\in\{0,1\}$1-player mechanism has liquid price of anarchy at least $a_t\in\{0,1\}$2 (Caragiannis et al., 2017). Deterministic allocation is therefore compatible with constant-factor guarantees, but not with full efficiency.

In procurement and mechanism design, deterministic budget allocation appears as truthful budget-feasible selection with approximation guarantees. Deterministic descending clock auctions answer an open question by giving a polynomial-time constant-approximation mechanism for monotone submodular valuations: Iterative-Pruning is deterministic, budget-feasible, and achieves approximation factor $a_t\in\{0,1\}$3; Simultaneous-Iterative-Pruning gives a $a_t\in\{0,1\}$4-approximation for general submodular valuations; and the subadditive case admits a deterministic $a_t\in\{0,1\}$5-approximation (Balkanski et al., 2021). For partial procurement, deterministic truthful mechanisms extend to multiple service levels and divisible agents: the paper gives a $a_t\in\{0,1\}$6-approximation for the $a_t\in\{0,1\}$7-level setting and a deterministic $a_t\in\{0,1\}$8-approximation for linear divisible valuations (Amanatidis et al., 2023).

6. Network interventions, ranking manipulation, and fair allocation with perishability

In social-network intervention, deterministic budget allocation often takes threshold form. For two competing firms choosing between seeding and quality improvement, it is more profitable for firm $a_t\in\{0,1\}$9 to seed agent $\sum_{t=1}^{T} a_t c_t \le B$0 than to improve quality if

$\sum_{t=1}^{T} a_t c_t \le B$1

with an analogous condition for firm $\sum_{t=1}^{T} a_t c_t \le B$2. The optimal budget split is therefore a water-filling strategy over the centrality vector $\sum_{t=1}^{T} a_t c_t \le B$3: agents above the threshold are seeded, and the rest of the budget goes to quality (Fazeli et al., 2014). In binary opinion dynamics under the voter model, the allocation problem is instead cast as a discounted Markov decision process with Bellman equations over the state and remaining budget; the optimal policy is obtained by backward programming, and the reported toy example on a fully connected network with $\sum_{t=1}^{T} a_t c_t \le B$4 invests the entire budget at $\sum_{t=1}^{T} a_t c_t \le B$5 (Rey et al., 2017).

In ranked-object reinforcement, deterministic budget allocation becomes a geometric redistribution problem over score distributions. The paper shows that the best ranking is achieved by equalizing the scores of several disjoint score ranges, that there is a unique optimal reinforcement strategy, and that the construction is governed by a threshold slope $\sum_{t=1}^{T} a_t c_t \le B$6 and chord lines on the complement c.d.f. The budget used by a fixed-$\sum_{t=1}^{T} a_t c_t \le B$7 reinforcement is monotone in $\sum_{t=1}^{T} a_t c_t \le B$8, which supports an efficient binary-search implementation (Ban et al., 2022).

Perishable-resource allocation adds another structured deterministic rule. Perishing-Guardrail takes as input a prediction of the perishing order and a desired hindsight-envy bound, computes a conservative baseline allocation $\sum_{t=1}^{T} a_t c_t \le B$9 and an aggressive guardrail $x^{(i)}\in[0,1]$0, and then chooses among three deterministic cases depending on the remaining budget, current arrivals, and a pessimistic spoilage forecast. The paper proves lower bounds showing that perishability induces an endogenous loss relative to the no-perishing setting, and gives bounds on counterfactual envy, hindsight envy, and inefficiency that are tight up to polylogarithmic factors (Banerjee et al., 2024).

Taken together, these results suggest that deterministic budget allocation is best understood as a family of constrained decision rules whose technical content depends on the surrounding model class. In fixed-budget statistical optimization, determinism is expressed through asymptotically or finitely optimal allocation ratios; in online learning, it frequently survives as a deterministic inner optimizer; in strategic environments, it is constrained by truthfulness, competitive ratio, and welfare benchmarks; and in networked or perishable systems, it often reduces to threshold, guardrail, or dynamic-programming structure rather than to a single closed-form split.