The paper evaluates index-based allocation policies using data from randomized control trials.
problem Evaluating index-based allocation policies in resource-scarce scenarios.
method Using data from randomized control trials, the paper introduces an efficient estimator and methods for computing asymptotically correct confidence intervals.
result Valid statistical conclusions can be drawn for index-based allocation policies.
Study optimizes portfolio allocation policies using off-policy data and constraints.
problem Optimizing portfolio allocation policies under constraints using off-policy data.
method Solves a minimax objective with off-policy estimators and online learning to control constraint violations.
result Constructs near-optimal allocation policies for various regimes of operation and constraints.
The paper optimizes DIA purchase policies using lifecycle models and asset allocation.
problem Determining the optimal allocation to Deferred Income Annuities (DIAs).
method Employed a lifecycle model with utility of consumption and bequest, formalized optimization process, analyzed results, and extended model to include asset allocation.
result Optimal DIA allocation varies based on refundability, asset allocation, and perceived longevity.
The paper proposes a new policy for optimal treatment allocation based on quantile treatment effects.
problem Optimal treatment allocation policies that target distributional welfare, especially when individuals are heterogeneous.
method The approach involves allocating treatments based on the conditional quantile of individual treatment effects (QoTE), considering both prudent and negligent policymakers.
result The proposed minimax policies are robust to model uncertainty and can be generalized to various settings.
RL agents outperform baselines in asset allocation.
problem Optimizing asset allocation using reinforcement learning.
method Model-free deep RL agents trained on real-world stock prices.
result RL agents significantly outperformed random and uniform allocation.
New estimator improves policy evaluation in resource allocation RCTs.
problem Difficulty in evaluating policies optimizing limited resource allocation through RCTs.
method Proposes a novel estimator involving retrospective reshuffling of participants across experimental arms.
result The new estimator provides more accurate policy evaluations than common methods.
The paper introduces SuccessProbaMax to optimize policy success probability in online advertising.
problem Optimizing policy success probability in online advertising systems.
method SuccessProbaMax algorithm that optimizes for the probability of success rather than expected value.
result SuccessProbaMax outperforms conventional algorithms in terms of success rate.
This study uses OPE methods to quickly assess auction policies.
problem Rapid decision-making in dynamic auction environments.
method Off-Policy Evaluation and counterfactual methods.
result Improved policy selection and optimization.
Develops adaptive framework for estimating survival effects with censoring.
problem Estimating causal effects in survival data with censoring.
method Derives semiparametric efficiency bound, proposes efficiency-optimal allocation policy, and develops Adaptive Survival Estimator (ASE).
result ASE achieves asymptotic normality via martingale central limit theorem and demonstrates efficiency gains over uniform randomization.
Proposes a new method to optimize treatment allocation with budget constraints.
problem Optimizing treatment allocation with budget constraints in marketing.
method Learning to rank for profit maximization.
result Learning to rank can maximize the area under a policy's incremental profit curve.
Paper proposes OPF policy for fair resource allocation with sublinear regret.
problem Fair resource allocation in an online setting against an unrestricted adversary.
method Online Proportional Fair (OPF) policy achieving approximate sublinear regret.
result OPF policy achieves cα-approximate sublinear regret with cα≤1.445. Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervised learning problem, have been proposed recently. Finding good policies with such methods requires not only an appropriate classifier, but also reliable e…
We consider effort allocation in crowdsourcing, where we wish to assign labeling tasks to imperfect homogeneous crowd workers to maximize overall accuracy in a continuous-time Bayesian setting, subject to budget and time constraints. The Bayes-optimal policy for this problem is the solution to a partially observable Ma…
In crowd labeling, a large amount of unlabeled data instances are outsourced to a crowd of workers. Workers will be paid for each label they provide, but the labeling requester usually has only a limited amount of the budget. Since data instances have different levels of labeling difficulty and workers have different r…
Optimal dynamic allocation of carbon allowances reduces emissions efficiently.
problem Reducing carbon emissions from firms over time with dynamic allocation and trading.
method Variational approach to solve the Stackelberg game between regulator and firms.
result Optimal policies lead to constant abatement effort and allowance price, outperforming static allocations.
Under a Bayesian framework, we formulate the fully sequential sampling and selection decision in statistical ranking and selection as a stochastic control problem, and derive the associated Bellman equation. Using value function approximation, we derive an approximately optimal allocation policy. We show that this poli…
In the coming years, the satellite broadband market will experience significant increases in the service demand, especially for the mobility sector, where demand is burstier. Many of the next generation of satellites will be equipped with numerous degrees of freedom in power and bandwidth allocation capabilities, makin…
The paper tackles fair policy targeting by optimizing allocation rules to minimize unfairness.
problem Discrimination in individualized treatments of social welfare programs.
method Formulated as a mixed-integer linear program, solved using off-the-shelf algorithms, derived regret bounds and small sample guarantees.
result Designs fair and efficient treatment allocation rules within the Pareto frontier.
Algorithm reduces long-term policy regret in ML decision-making.
problem Capturing long-term impacts of ML decisions in communities.
method Modeling communities as arms in a multi-armed bandit problem, defining policy regret as a stronger metric than external regret.
result Algorithm achieves provably sub-linear policy regret for long time horizons.
The purpose of this paper is to provide further understanding into the structure of the sequential allocation ("stochastic multi-armed bandit", or MAB) problem by establishing probability one finite horizon bounds and convergence rates for the sample (or "pseudo") regret associated with two simple classes of allocation…
Optimizes deep reinforcement learning for energy-efficient video streaming.
problem Minimizing energy consumption in video streaming over mobile networks.
method Integrates DDPG algorithm with partially known model to reduce signaling overhead and improve convergence speed.
result Proposed policy converges to optimal policy with improved convergence speed.
Adaptive AI delegation framework for dynamic decision authority allocation.
problem Dynamic allocation of decision authority to AI-generated recommendations under evolving evidence quality and uncertainty.
method Formulated as a Governance-Aware POMDP, using Bayesian inference for informational state estimation and sequential optimization for authority allocation.
result Sequential Bayesian governance provides the strongest general-purpose policy across AI-quality regimes, adapting to evolving evidence.
Learning optimal resource allocation policies in wireless systems can be effectively achieved by formulating finite dimensional constrained programs which depend on system configuration, as well as the adopted learning parameterization. The interest here is in cases where system models are unavailable, prompting method…
RL learns to ignore factors in factor investing portfolios.
problem Combining factor investing and reinforcement learning for optimal portfolio allocation.
method RL agent learns through sequential allocations based on firms' characteristics using Dirichlet distributions.
result RL-based portfolios are very close to equally-weighted allocations, indicating agnostic factor learning.
We address a practical problem ubiquitous in modern marketing campaigns, in which a central agent tries to learn a policy for allocating strategic financial incentives to customers and observes only bandit feedback. In contrast to traditional policy optimization frameworks, we take into account the additional reward st…
This paper considers the design of optimal resource allocation policies in wireless communication systems which are generically modeled as a functional optimization problem with stochastic constraints. These optimization problems have the structure of a learning problem in which the statistical loss appears as a constr…
Proposes a new sampling policy for ranking and selection problems.
problem Improving ranking and selection in adaptive sampling policies.
method Annealed entropic allocation, using soft-min weights and saddlepoint corrections.
result Consistently competitive performance in various settings.
This paper presents a novel deep reinforcement learning-based resource allocation technique for the multi-agent environment presented by a cognitive radio network that coexists through underlay dynamic spectrum access (DSA) with a primary network. The resource allocation technique presented in this work is distributed,…
Study efficient resource allocation for detecting extreme values.
problem Efficiently allocate limited resources to detect extreme values in various fields.
method Proposes ExtremeHunter algorithm for sequential resource allocation under limited feedback.
result Demonstrates ExtremeHunter outperforms oracle policy in detecting extreme values.
Paper uses DRL to optimize portfolios, balancing risk and return.
problem Optimizing portfolios under market uncertainty and risk constraints.
method Integrates Sharpe ratio-based reward with risk control mechanisms, uses PPO for adaptive asset allocation.
result DRL agent stabilizes volatility but sacrifices risk-adjusted returns.
Algorithm identifies best policy in MDPs with adaptive sampling.
problem Best policy identification in discounted MDPs with limited samples.
method Derive lower and upper bounds on sample complexity, design KLB-TS algorithm.
result KLB-TS algorithm achieves nearly-optimal sample allocation.
Deep imagination optimizes decision-making in large trees with limited resources.
problem Optimal planning in large decision trees with limited resources and time.
method Analytical solutions and numerical analysis of sampling capacity allocation.
result Optimal policy is to allocate few samples per level for deep exploration, favoring depth over breadth.
Scheduling and power allocation improve federated learning efficiency in NOMA networks.
problem Efficiently scheduling and allocating power for federated learning in bandwidth-limited wireless networks.
method Proposed a scheduling policy and power allocation scheme using NOMA to maximize data rate and convergence speed.
result Simulation results show improved federated learning accuracy in NOMA networks.
Paper uses LLMs for sector allocation, showing better returns.
problem Automated trading sector allocation inefficiencies.
method Systematic analysis of macroeconomic data and sentiment.
result LLM-based sector allocation outperforms traditional strategies.
In treatment allocation problems the individuals to be treated often arrive sequentially. We study a problem in which the policy maker is not only interested in the expected cumulative welfare but is also concerned about the uncertainty/risk of the treatment outcomes. At the outset, the total number of treatment assign…
This paper tackles post-trade allocation inefficiencies and presents a uniform return allocation method.
problem Return divergence among accounts after trade allocation.
method Systematic treatment of trade allocation risk, presenting a uniform return allocation method.
result Uniform allocation of returns irrespective of the number of accounts and trade sizes.
This paper explains CART random forests using stochastic control theory.
problem Understanding the inner workings of CART random forests.
method Developed a stochastic-control perspective on CART random forests, interpreting feature subsampling as a random feasible action set and the split rule as a policy.
result Established that the CART policy is locally stabilizing but globally suboptimal for the forest objective.
Study uses RL to optimize risky vs. risk-free asset allocation.
problem Optimal asset allocation in volatile financial markets.
method Formulated as MDP, uses DDPG with TiDE for dynamic policy learning.
result DDPG-TiDE outperforms Q-learning and buy-and-hold strategies.
Skewness dispersion predicts future stock market returns, especially in months with monetary policy announcements.
problem Predicting future stock market returns using skewness dispersion.
method Cross-sectional analysis of firm-level realized skewness and stock market returns.
result Skewness dispersion is a significant predictor of future stock market returns, robust to various estimation methods.
Efficient deep policy gradient method for continuous-time control problems.
problem Optimal control in continuous time with fine time discretization.
method Multi-scale deep policy gradient method with varying time discretization.
result Targeted efficiency in computational resources achieved through multi-scale approach.
Optimal resource allocation is a fundamental challenge for dense and heterogeneous wireless networks with massive wireless connections. Because of the non-convex nature of the optimization problem, it is computationally demanding to obtain the optimal resource allocation. Recently, deep reinforcement learning (DRL) has…
Study dynamic asset allocation in incomplete markets using game theory and nonlocal BSDEs.
problem Dynamic mean-variance asset allocation in general incomplete markets with non-exponential discounting.
method Game-theoretic approach, decomposition into myopic and hedging strategies, nonlocal BSDEs, fixed-point theorem.
result Well-posedness of solutions to BSDEs, existence of equilibrium control policy.
Optimizes resource allocation for distributed parameter estimation in sensor networks.
problem Maximizing accuracy in parameter estimation with limited resources.
method Formulates a data collection and collaboration policy design problem as a Fisher information maximization problem. Proposes multi-armed bandit algorithms for learning the optimal policy.
result Identifies optimal data collection and collaboration policies that balance resource use and estimation accuracy.
The Australian Government uses the means-test as a way of managing the pension budget. Changes in Age Pension policy impose difficulties in retirement modelling due to policy risk, but any major changes tend to be `grandfathered' meaning that current retirees are exempt from the new changes. In 2015, two important chan…
Study finds stock selection ability of Chinese mutual funds is better than asset allocation ability.
problem Evaluating the performance of actively managed mutual funds in China.
method Developed performance measures for asset allocation and selection using holding-based models and compared them with Fama-French and Treynor-Mazuy models.
result Stock selection ability from holding-based models is positively correlated with Fama-French model, while industry allocation is positively correlated with Treynor-Mazuy model.
The paper studies how to allocate human validation in AI-assisted tasks to minimize errors.
problem Heterogeneous reliability of AI-generated signals across tasks, products, and customer segments.
method Tuned prediction-powered inference, upper confidence bounds policy, Neyman square-root rule.
result The proposed policy outperforms uniform and epsilon-greedy allocation, closing most of the gap to the oracle when reliability is heterogeneous.
Develops a new method for statistical optimal allocation problems.
problem Statistical optimal allocation problems with constraints.
method Functional differentiability approach and Hadamard differentiability of value functions.
result Validates margin assumption for fast convergence rate of plug-in methods.
Batch Thompson Sampling reduces exploration-exploitation trade-off in online decision making.
problem Balancing exploration and exploitation in online decision making.
method Introducing a batch Thompson Sampling framework for stochastic multi-arm bandit and linear contextual bandit problems.
result Achieves asymptotic regret bound with O(logT) batch queries, significantly reducing interactions.