Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

295988117 · May 202619922001200920172026
48 results for Demand side management

Deep RL agent secures 2nd place in CityLearn Challenge for district demand management.

problem Optimizing electrical demand of diverse buildings in a district.
method Centralised 'Soft Actor Critic' deep reinforcement learning agent.
result Achieved an averaged score of 0.967 on challenge dataset.

New algorithm controls large groups of devices to match energy demand signals.

problem Controlling large populations of electrical devices to match energy demand signals.
method Developed MD-MFC algorithm for finite horizon Markovian mean field control problem.
result MD-MFC provides theoretical guarantees for convex and Lipschitz objective functions.

RL agent learns to save costs by managing household energy storage.

problem Maximizing cost savings in smart grids with household energy storage.
method Data-driven RL agent learns from tariff structures and storage capacity.
result RL agent explains its learning process and strategies.

Paper optimizes demand aggregation for low-level electricity markets.

problem Accurate short-term load forecasting at low aggregation levels for market participants.
method Probabilistic portfolio optimization of residential households' demand using ARMA-GARCH models or KDE forecasts.
result Seasonal Residual approach outperforms others in accuracy and efficiency.

Smart grid uses deep learning to optimize household energy use.

problem Optimizing household energy use under real-time pricing schemes.
method Multi-agent deep actor-critic learning for decentralized agents with partial observability.
result Deep reinforcement learning reduces peak-to-average energy consumption and costs.

The paper tackles revenue management with time-varying demand using posterior sampling.

problem Maximizing revenue in real-time applications with unknown and time-varying demand.
method Episodic generalization of RM problem, posterior sampling algorithm for linear programming optimization.
result The proposed algorithm outperforms other methods and is comparable to the optimal policy in hindsight.

Solves inventory control with unknown demand trend using singular control.

problem Optimally managing inventory with an unknown demand trend.
method Formulates as a stochastic control problem under partial observation, solves equivalent separated problem using transition between formulations, and applies viscosity theory.
result Constructs an optimal control rule and shows bounded Lipschitz continuity of free boundaries.

We consider a continuous-time model for inventory management with Markov modulated non-stationary demands. We introduce active learning by assuming that the state of the world is unobserved and must be inferred by the manager. We also assume that demands are observed only when they are completely met. We first derive t…

2012-06-27abs ↗pdf ↗

Bitcoin option prices reflect both market maker supply and trader demand, especially from those with insider information.

problem Understanding how market prices of bitcoin options are influenced by both market makers and informed traders.
method Analysis of Deribit options tick-level data to identify supply and demand effects.
result At-the-money option prices are driven by volatility traders, while out-of-the-money options are influenced by both volatility traders and those with insider information.

We propose a continuous-time stock-flow consistent model for inventory dynamics in an economy with firms, banks, and households. On the supply side, firms decide on production based on adaptive expectations for sales demand and a desired level of inventories. On the demand side, investment is determined as a function o…

2016-10-04abs ↗pdf ↗

Study uses RL to optimize crypto portfolios with two-sided transactions and lending.

problem Managing downside risk and capital optimization in high-risk crypto markets.
method Integrates RL with a new environmental formulation and PnL-based reward function, using SAC agent with CNN-MHA.
result Significantly outperforms benchmarks, especially in high-volatility scenarios.

Improved regret bounds for inventory management with unknown demand distribution.

problem Stochastic inventory control problem with censored demands and positive lead times.
method Utilized convexity properties and derived bias bounds to connect to stochastic convex bandit optimization.
result Regret bound of ildeO(LT+D) ilde{O}(L\sqrt{T}+D) for the inventory control problem.

A new microeconomic model is presented that aims at a description of the long-term unit sales and price evolution of homogeneous non-durable goods in polypoly markets. It merges the product lifecycle approach with the price dispersion dynamics of homogeneous goods. The model predicts a minimum critical lifetime of non-…

2011-09-27abs ↗pdf ↗

Since governments give stimulus to firms and expect the spillover effect by fiscal policies, it is important to know the effectiveness that they can control the economy. To clarify the controllability of the economy, we investigate a firm production network observed exhaustively in Japan and what firms should be direct…

2016-04-05abs ↗pdf ↗

Paper introduces Decentralized Non-stationary Competing Bandits ( exttt{DNCB}) for dynamic matching markets.

problem Understanding dynamic two-sided matching markets with competing agents.
method Proposes a decentralized asynchronous learning algorithm ( exttt{DNCB}) for non-stationary environments.
result Obtains sub-linear (logarithmic) regret of exttt{DNCB} in dynamic settings.

Study optimizes smart contract adoption under high demand variability using Negative Binomial models.

problem Effective supply chain management under high demand variability.
method Combines dynamic Negative Binomial demand modeling with endogenous smart contract adoption optimization.
result The NB model outperforms other benchmarks in forecasting and optimizing smart contract adoption and order quantity.

Study examines how COVID-19 intensified demand variability in U.S. supply chains.

problem The amplification of demand variability (Bullwhip Effect) in supply chains during the pandemic.
method Extensive industry-level data analysis using traditional and advanced empirical techniques.
result COVID-19 significantly amplified the Bullwhip Effect across different U.S. industries.

This paper optimizes revenue and resource balance in network revenue management.

problem Maximizing revenue while ensuring fair resource consumption across different suppliers.
method Introduces a regularized revenue objective and a primal-dual UCB algorithm for continuous prices and balancing.
result Achieves a worst-case regret of O~(N5/2T)\widetilde O(N^{5/2}\sqrt{T}) for revenue maximization and balancing.

We consider a repeated newsvendor problem where the inventory manager has no prior information about the demand, and can access only censored/sales data. In analogy to multi-armed bandit problems, the manager needs to simultaneously "explore" and "exploit" with her inventory decisions, in order to minimize the cumulati…

2017-10-16abs ↗pdf ↗

Deep learning model reduces food waste by stabilizing online food delivery supply chains.

problem Wastage and bullwhip effect in online food delivery services.
method Two-phase LSTM network for demand forecasting, newsvendor model for inventory management.
result Significant reduction in bullwhip effect and food waste, improved forecasting accuracy.

Predicting ambulance demand accurately at a fine resolution in time and space (e.g., every hour and 1 km2^2) is critical for staff / fleet management and dynamic deployment. There are several challenges: though the dataset is typically large-scale, demand per time period and locality is almost always zero. The demand …

2016-06-16abs ↗pdf ↗

MaxCOSD algorithm tackles non-i.i.d. demands and stateful dynamics in online inventory control.

problem Managing inventory with non-i.i.d. demands and stateful dynamics.
method MaxCOSD, an online algorithm with provable guarantees for non-degeneracy assumptions.
result MaxCOSD achieves optimal performance for non-i.i.d. demands and stateful dynamics.

We consider dynamic pricing with many products under an evolving but low-dimensional demand model. Assuming the temporal variation in cross-elasticities exhibits low-rank structure based on fixed (latent) features of the products, we show that the revenue maximization problem reduces to an online bandit convex optimiza…

2018-01-30abs ↗pdf ↗

Optimal market making strategy with price forecasts reduces inventory costs and spreads.

problem Optimal market making strategy with price forecasts reduces inventory costs and spreads.
method Modeling market making strategy with linear price impact, random slope and intercept, and simultaneous order arrivals.
result Simultaneous order arrivals and price forecasts reduce inventory costs and spreads.

CROCS clusters consumer behaviour from smart meters, capturing variability and robustness.

problem Insufficient consumer segmentation in existing clustering methods.
method Two-stage clustering framework: first stage clusters daily load profiles, second stage uses WSMD for set-to-set comparison.
result CROCS captures intra-consumer variability and robustness to anomalies and missing data.

A new approach integrates inventory prediction and routing optimization for better supply chain management.

problem Optimizing efficient route selection in supply chain management with uncertain inventory demand.
method Decision-focused learning approach using neural networks to directly integrate inventory prediction and routing optimization.
result Direct integration of inventory prediction and routing optimization leads to better supply chain decisions.

Real time bidding (RTB) enables demand side platforms (bidders) to scale ad campaigns across multiple publishers affiliated to an RTB ad exchange. While driving multiple campaigns for mobile app install ads via RTB, the bidder typically has to: (i) maintain each campaign's efficiency (i.e., meet advertiser's target cos…

2018-11-11abs ↗pdf ↗

Study on revenue management with limited switches, achieving strong performance and reduced switch counts.

problem Resource-constrained dynamic pricing with limited switching constraints.
method Developed algorithms for blind network revenue management and bandits with knapsacks, achieving optimal regret rates.
result Optimal regret rates are fully characterized by a piecewise-constant function of the switching budget and resource constraints.

New model predicts ICU patient stays more accurately.

problem Efficient ICU bed allocation under resource constraints.
method Temporal Pointwise Convolutional Networks (TPC) combining temporal and pointwise convolutions.
result Significant performance improvements over LSTM and Transformer models.

Detecting faults and SLA violations in a timely manner is critical for telecom providers, in order to avoid loss in business, revenue and reputation. At the same time predicting SLA violations for user services in telecom environments is difficult, due to time-varying user demands and infrastructure load conditions. In…

2015-09-04abs ↗pdf ↗