Proposes a new allocation method for distributionally robust ranking and selection.
problem Inaccurate simulation input modeling due to limited data.
method Introduces a simple additive allocation (AA) procedure and a general additive allocation (GAA) framework.
result Proves that the proposed AA procedure is consistent and achieves additivity in the strongest sense.
The paper analyzes insurance pricing and capital allocation in imperfect markets.
problem Analyzing insurance pricing and capital allocation in imperfect markets.
method Non-additive distortion pricing functional and principle of equal priority of payments in default.
result Derives the natural allocation of premium and margin with properties that merit the name.
Paper uses Simulated Bifurcation for quick asset allocation optimization.
problem Optimal asset allocation selection.
method Simulated Bifurcation algorithms applied to 441 S&P500 assets.
result Unrivaled timescale for optimal sub-allocation selection.
This work reviews and tests risk allocation strategies in finance, highlighting Shapley allocation's advantages.
problem Risk allocation in financial institutions with non-additive risk measures and layered structures.
method Systematic review of risk allocation strategies, testing in simplified and realistic settings, including Basel 2.5 and FRTB.
result Shapley allocation offers the best compromise between simplicity, mathematical properties, and computational cost.
Overprocuring reserves can improve network efficiency by using excess reserves for congestion management.
problem Optimizing energy and reserve allocation between zones to minimize costs and ensure deliverability.
method Developed allocation models for co-allocating traded energy and reserve products, considering both deterministic and stochastic flows.
result Excess reserve supplies can be used for congestion management, leading to additional network benefits.
Solves asset allocation for investors with utility functions and limits.
problem Investor risk and utility with position limits.
method Analytical solution for piecewise-linear utility function with position limits.
result Simple functional form representing risk cost.
Enhanced synthetic dataset improves asset allocation analysis.
problem Lack of realistic synthetic data for fixed income portfolio construction.
method Improved CorrGAN model for synthetic correlation matrices and Encoder-Decoder model for additional data conditioning.
result Synthetic dataset enhances portfolio construction and asset allocation analysis.
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. New OCBA procedures minimize PICS in robust R&S.
problem Selecting the best alternative under input uncertainty.
method Developed new asymptotically optimal OCBA procedures.
result Procedures minimize probability of incorrect selection.
This work introduces COLA, a strategy to aggregate conformal prediction sets efficiently.
problem Efficiently combining multiple conformity scores to reduce prediction set size.
method Introduces COnfidence-Level Allocation (COLA) to optimally allocate confidence levels across sets.
result COLA achieves smaller prediction sets than state-of-the-art methods while maintaining valid coverage.
Social sensing has emerged as a new sensing paradigm where humans (or devices on their behalf) collectively report measurements about the physical world. This paper focuses on a quality-cost-aware task allocation problem in multi-attribute social sensing applications. The goal is to identify a task allocation strategy …
The paper addresses risk sharing and variability measures among agents with general risk preferences.
problem Risk sharing and variability measures among agents with general risk preferences.
method Characterizes Pareto-optimal allocations using Gini deviation, mean-median deviation, and inter-quantile difference as variability measures.
result Optimal allocations are not comonotonic and feature a mixture of pairwise counter-monotonic structures.
Diversified risk parity strategies outperform equally-weighted portfolios in various asset universes.
problem Finding optimal portfolio allocations that balance risk and reward.
method Integrates various reward-risk measures and generic allocation rules into diversified risk parity.
result Diversified reward-risk parity strategies exhibit higher average returns, Sharpe ratios, and Calmar ratios compared to equally-weighted risk portfolios.
Adaptive RL optimizes testing resource allocation for dynamic software environments.
problem Optimizing resource allocation for evolving software testing environments.
method Integrates Q-learning with hybrid reward design for sequential decision-making.
result Consistently outperforms static and optimization-based baselines in simulation studies.
Investigates optimal parameter allocation in Transformers for efficiency and expressivity.
problem Balancing expressivity and efficiency in Transformer model parameters.
method Mathematical analysis and theoretical characterization of attention heads and head dimensions.
result Later layers can operate more efficiently with reduced parameters due to saturation of softmax activations.
Develops deep learning for optimizing 5G radio resource allocation.
problem Optimizing 5G base station radio resources for diverse QoS requirements.
method Cascaded neural network structure with deep transfer learning for non-stationary conditions.
result Cascaded neural networks outperform fully connected neural networks in QoS guarantee.
In our previous paper, "A Unified Approach to Systemic Risk Measures via Acceptance Set" (\textit{Mathematical Finance, 2018}), we have introduced a general class of systemic risk measures that allow for random allocations to individual banks before aggregation of their risks. In the present paper, we prove the dual re…
TA-CQR predicts regression intervals with exact coverage, splitting miscoverage between endpoints.
problem Predicting regression intervals with exact coverage under reporting constraints.
method TA-CQR uses tail allocation to parameterize the oracle, estimating the allocation by searching quantile cores and applying nonnegative additive split-conformal calibration.
result TA-CQR achieves exact finite-sample marginal coverage under exchangeability, with theoretical guarantees on calibration and length.
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.
The paper introduces a portfolio construction method using Black-Litterman model and factors.
problem Developing an efficient portfolio construction method using Black-Litterman model and factors.
method The method involves selecting 20 factors based on global market, asset class, and stock characteristics, applying various weight allocation methods including Black-Litterman model, and incorporating deep learning for dynamic weight updates.
result The model using Black-Litterman and deep learning outperforms other weight allocation schemes.
A new model forecasts optimal portfolio weights from high-frequency data.
problem Forecasting optimal portfolio weights from high-frequency data.
method Dynamic Conditional Weights (DCW) model for portfolio weights dynamics.
result DCW model outperforms other models in portfolio allocations and measures.
Investing in cryptocurrencies can improve portfolio risk-return profile, especially with diversification strategies.
problem Investing in cryptocurrencies and evaluating their potential for portfolio allocation strategies.
method Investigated different types of investors, various portfolio construction rules, and incorporated liquidity constraints.
result Cryptocurrencies can improve the risk-return profile of portfolios, especially with diversification strategies.
Unified framework for robust risk measures beyond convexity.
problem Developing risk measures for uncertainty beyond classical convexity.
method Constructing robust quasi-convex measures through uncertainty sets.
result Unified framework for robust quasi-convex risk measures.
New foundation for Shapley value immune to coalitional manipulations.
problem Coalitional manipulations in game theory.
method Revised Shapley value criteria for coalitional games.
result Shapley value is immune to coalitional manipulations under new criteria.
The paper proposes an online algorithm for network resource allocation with reduced costs.
problem Optimizing resource allocation and job transfers in a network of servers.
method Randomized online algorithm based on the exponentially weighted method.
result The algorithm achieves sub-linear regret, indicating improved efficiency over time.
This paper proposes a continuous timing strategy for growth vs. defensive style allocation.
problem Dynamic allocation of growth and defensive ETF baskets using macro-market timing signals.
method Continuous smooth score combining multiple factors, mapped to G/D weights, smoothed with EWMA.
result Continuous style timing strategy outperforms static benchmarks in risk-adjusted returns.
We consider the problem of how to assign treatment in a randomized experiment, in which the correlation among the outcomes is informed by a network available pre-intervention. Working within the potential outcome causal framework, we develop a class of models that posit such a correlation structure among the outcomes. …
Proposes a deep learning approach for optimizing portfolios with stocks and options.
problem Optimizing portfolios with time-inconsistent objectives and trading constraints.
method Neural networks with adaptive activation functions for asset allocation and option strike prices.
result Adding options leads to more stable and consistent stock allocations.
Investors optimize liquid staking decisions in LSP and AMM protocols.
problem Optimal timing and allocation in liquid staking protocols.
method Derive optimal allocation strategy and model optimal exit timing using Laplace transforms and free-boundary techniques.
result Optimal stop-loss strategy maximizes expected payoff, influenced by fees and opportunity gains.
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…
Algorithm learns fair division from noisy feedback in uncertain markets.
problem Learning fair division in uncertain markets with noisy feedback.
method Wrapper algorithms using dual averaging to learn item and agent values from bandit feedback.
result Asymptotically achieves optimal Nash social welfare in linear Fisher markets.
The paper shows vector-valued risk measures ignore dependence structures.
problem Defining capital allocation rules for random vectors with dependence.
method Defined vector-valued risk measures by axioms and showed their properties.
result Vector-valued risk measures ignore dependence structures, unlike set-valued measures.
The financial crisis of 2008 generated interest in more transparent, rules-based strategies for portfolio construction, with Smart beta strategies emerging as a trend among institutional investors. While they perform well in the long run, these strategies often suffer from severe short-term drawdown (peak-to-trough dec…
Optimizes query routing to LLMs under cost and resource constraints.
problem Non-uniform or adversarial batching in per-query routing methods leads to cost inefficiency.
method Batch-level, resource-aware routing framework that jointly optimizes model assignment for each batch.
result Robust routing framework improves accuracy by 1-14% over non-robust methods.
NPAS trains neural networks with a fixed parameter budget, improving performance and compactness.
problem Training neural networks requires memory, and existing methods struggle with arbitrary parameter budgets.
method NPAS learns to share parameters automatically, covering low and high budgets.
result NPAS and SSNs improve network performance and compactness across various tasks.
clusterBMA combines clustering results from multiple models using Bayesian model averaging.
problem Uncertainty in model selection for clustering.
method Bayesian model averaging to combine results from multiple clustering algorithms.
result ClusterBMA offers probabilistic cluster allocations and quantifies model-based uncertainty.
Study wSAA for contextual decisions, improving uncertainty quantification under computational constraints.
problem Uncertainty quantification limitations in wSAA for contextual stochastic optimization.
method Establish central limit theorems and asymptotic-normality-based confidence intervals for optimal costs.
result Over-optimizing can mitigate misspecification and preserve asymptotic normality, albeit at a slower convergence rate.
Model explains capital allocation and wealth distribution dynamics in a frictional economy.
problem Understanding capital allocation and wealth distribution dynamics in a frictional economy.
method Mean-field game approach to model interactions between expert and household groups.
result Experts accumulate capital during booms and quickly reverse behavior in busts, even without macro-shocks.
Optimizes bidding strategies for LinkedIn ads across multiple platforms.
problem Optimizing automated bidding agents for dynamic online marketplaces.
method Developed a general optimization framework for buyer's interest, agnostic to auction mechanisms.
result Automatically guarantees the optimality of budget allocation across ad units and platforms.
Meta-ensemble scheme allocates queries to EC nodes for reduced latency.
problem Efficiently allocating queries to EC nodes to minimize latency.
method Combining ensemble models to decide query allocation based on node and query characteristics.
result Meta-ensemble scheme outperforms traditional allocation methods in reducing query processing latency.
Optimizes resource allocation in a network with random job requests.
problem Minimizing costs while satisfying job requests within a budget.
method Formalizes as a repeated game, proposes an online saddle-point algorithm.
result Upper bounds for regret and constraint violations are derived.
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.
Study optimizes resource allocation in noisy systems for better control.
problem Limited attention in stochastic systems with multiplicative noise.
method Analytical and numerical methods for optimal attention allocation.
result Effective resource allocation enhances noise estimation and control decisions.
Algorithm learns interference network and optimizes treatment allocation for unknown network effects.
problem Adaptive experimentation under unknown network interference.
method Thompson sampling algorithm with Gibbs sampler for joint learning of interference network and treatment allocation.
result Proves a Bayesian regret bound and achieves sublinear regret in real-world applications.
The paper proposes an asset allocation strategy using the Sortino ratio for better performance.
problem Traditional asset allocation methods like the Sharpe ratio do not penalize negative returns adequately.
method The Sortino ratio is used to maximize asset allocation, penalizing only negative return variances.
result The Sortino ratio-based strategy outperforms traditional methods like the Kelly criterion.
ANN-based dynamic portfolio optimization outperforms traditional methods.
problem Optimizing dynamic portfolios in finance.
method Using artificial neural networks for dynamic portfolio allocation.
result ANN-based strategies outperform traditional methods in optimal portfolio allocation.
Mathematical model for focused investing reduces diversification risks.
problem Reduces diversification risks in focused investing portfolios.
method Generalized Kelly Criterion with constraints for optimal capital allocation.
result Software shows excessive diversification in real portfolios.
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.