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.
Model analyzes RFQ markets using stochastic control to optimize dealer performance and inventory.
problem Optimizing market making in aggregator-routed RFQ markets with varying dealer performance scores.
method Two-tier stochastic control model that separates RFQ-level price competition from macro routing.
result Optimal controls can be expressed through derivatives of reduced Hamiltonians, leading to interpretable mappings from optimal win probabilities to optimal offsets.
Study shows marketable order routing to wholesalers benefits all traders, leading to lower market depth and price volatility.
problem Determining the preference of retail traders for marketable order routing.
method Two models: one for market makers competing for retail order flow (Bertrand model) and another for price-taking competitive liquidity providers (open exchange model).
result Routing marketable orders to wholesalers is preferred by all traders, leading to mean reverting inventories and lower market depth.
DFMM automates market making with adaptive pricing and risk management.
problem Challenges in decentralised automated market making (AMMs).
method Data aggregator, order routing, rebalancing, arbitrageurs, protective buffers, algorithmic accounting.
result DFMM optimises inventory risk and ensures market stability.
Bayesian optimization improves forest inventory sampling using remote sensing data.
problem Optimizing forest inventory sampling in large areas with limited data.
method Bayesian optimization applied to RS data for improved sampling design.
result The proposed method outperforms baseline methods in terms of MSE values.
In this paper we extend the market-making models with inventory constraints of Avellaneda and Stoikov ("High-frequency trading in a limit-order book", Quantitative Finance Vol.8 No.3 2008) and Gueant, Lehalle and Fernandez-Tapia ("Dealing with inventory risk", Preprint 2011) to the case of a rather general class of mid…
Study finds inventory inaccuracies are linked to store activity and product perishability.
problem Inventory record inaccuracy in grocery retailing environments.
method Analysis of 24,000 SKUs across 11 stores, field quasi-experiment on audits.
result Inventory audits can boost sales by 11%, especially for perishable items.
ML4CO uses machine learning to improve combinatorial optimization solvers.
problem Solving combinatorial problems in practice often involves related data distributions.
method Replacing heuristic components with machine learning approaches.
result Improved state-of-the-art combinatorial optimization solvers.
In this paper we complete and extend our previous work on stochastic control applied to high frequency market-making with inventory constraints and directional bets. Our new model admits several state variables (e.g. market spread, stochastic volatility and intensities of market orders) provided the full system is Mark…
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…
The paper tackles dynamic collateral control for spot-perpetual basis trading in decentralized finance.
problem Dynamic control of collateral in spot-perpetual basis trading in decentralized finance.
method Solves a static control problem and derives an asymmetric dynamic extension, validated with live execution.
result The dynamic control approach provides a more robust operating benchmark and shows significant rebalancing effects.
This paper offers a mathematical framework to manage inventory risk in FX cash markets.
problem Inventory risk in FX cash markets due to flow uncertainty and volatility.
method Mathematical framework and approximation techniques for scalability.
result Maximizing expected profit while controlling inventory risk.
Study optimal pricing and inventory control in dynamic settings with censored demand.
problem Optimal pricing and inventory control in dynamic settings with censored demand.
method Approximate optimal policy via high-order MDP, propose novel algorithms for solving Bellman equations.
result Established finite-sample regret bounds and demonstrated efficacy through numerical experiments.
ISOMORPH creates a digital twin for supply chain logistics, advancing time-series forecasting benchmarks.
problem Lack of public benchmarks for supply chain logistics time-series forecasting.
method Developed a digital twin simulator with interpretable parameters and modular topology, generating datasets and verifying conservation laws.
result Foundation models achieve MASE values exceeding public benchmarks at low-to-moderate horizons, supporting UQ.
Policy certifies inventory levels meeting service requirements.
problem Maintaining stock levels meeting service requirements despite unknown demand.
method Data-driven order policy using online learning and integral action.
result Valid inference method for finite samples.
Axiomatizes the bid-ask market maker's quoting rule
problem Axiomatizing the quoting rule of a market maker
method Eight natural axioms and six environmental assumptions
result A unique three-parameter family emerges
Study on inventory control with changing demand, proposing adaptive algorithms.
problem Inventory control with non-stationary demand distributions.
method Adaptive online algorithms optimizing base-stock policies.
result Sharp separation in adaptability across different inventory models.
This paper optimizes perpetual contract liquidity by accounting for funding rates.
problem Optimal liquidity provision for perpetual contracts with stochastic funding rates.
method Formulated a control problem, solved with a HJB scheme, and calibrated on real data.
result Funding-aware market making improves performance and reduces inventory risk.
A contextual bandit method evaluates and improves inventory control policies.
problem Evaluating and improving periodic review inventory control policies with nonstationary demand.
method Contextual bandit-based algorithm to evaluate and tweak policies.
result The method achieves favorable guarantees in both theory and practice.
The basic financial purpose of a firm is to maximize its value. An inventory management system should also contribute to realization of this basic aim. Many current asset management models currently found in financial management literature were constructed with the assumption of book profit maximization as basic aim. H…
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…
Deep neural networks optimize inventory decisions in complex supply chains.
problem Optimizing inventory decisions in stochastic multi-echelon supply chains.
method Pairwise modeling and DNN agents for order-up-to levels.
result The method performs better than alternate methods in general supply chain networks.
The paper analyzes optimal execution strategies for traders with inventory processes influenced by Brownian motion.
problem Optimal execution strategies for traders with inventory processes influenced by Brownian motion.
method Statistical tests and empirical analysis of intra-day data from the Toronto Stock Exchange.
result Empirical evidence supports the presence of a non-zero Brownian motion component in inventories and wealth processes.
Optimal hidden-target learning for online inventory optimization on general convex sets.
problem Online inventory optimization (OIO) on arbitrary bounded convex capacity sets.
method Maintaining a hidden target and projecting it onto the feasible order-up-to set.
result The method improves the best known regret guarantee for OIO on general convex sets from inverse to inverse-square-root dependence on the common-demand probability.
We study the cross-correlation matrix Cij of inventory variations of the most active individual and institutional investors in an emerging market to understand the dynamics of inventory variations. We find that the distribution of cross-correlation coefficient Cij has a power-law form in the bulk followed by …
Paper tackles inventory management with deep learning, improving performance and adherence to constraints.
problem Managing inventory with limited resources and constraints.
method Proposes a novel method to sample from a distribution of possible constraint paths, extends exo-IDP formulation, introduces neural coordinator, and uses modified DirectBackprop algorithm.
result Deep reinforcement learning policies with a neural coordinator outperform classic baselines in terms of performance and adherence to constraints.
This paper tackles inventory control with general arrival dynamics and post-processing, improving profitability.
problem Inventory control with arbitrary arrival dynamics and post-processing constraints.
method Formulated as an exogenous decision process, incorporating deep generative models for arrivals, and applying supervised learning techniques.
result Improves profitability over production baselines and real-world A/B test data.
Paper combines RL with policy regularization for inventory policies.
problem Optimizing inventory policies using RL and dynamic programming.
method Hybrid approach combining RL with policy regularization.
result Generalization guarantees for inventory policies using VC theory.
Capsule networks improve performance on image classification tasks with fewer parameters.
problem Improving performance of capsule networks with fewer parameters.
method Inverted dot-product attention routing, Layer Normalization, concurrent iterative routing.
result Improves performance on benchmark datasets CIFAR-10 and CIFAR-100, and performs at-par with ResNet-18.
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.
Route Choice Models predict the route choices of travelers traversing an urban area. Most of the route choice models link route characteristics of alternative routes to those chosen by the drivers. The models play an important role in prediction of traffic levels on different routes and thus assist in development of ef…
Many retailers today employ inventory management systems based on Re-Order Point Policies, most of which rely on the assumption that all decreases in product inventory levels result from product sales. Unfortunately, it usually happens that small but random quantities of the product get lost, stolen or broken without r…
JAMPR learns to solve complex VRP with time windows.
problem Vehicle routing problems with time windows and vehicle capacities.
method Joint attention to construct multiple routes concurrently.
result JAMPR outperforms existing models on different problem sizes.
Study visualizes actor-critic loss landscapes for inventory optimization.
problem Difficulties in solving multi-store dynamic inventory control problems.
method Low-dimensional visualizations of actor loss function.
result Loss landscapes favor optimal policies in reinforcement learning.
Unified theory for optimal execution through signal-adaptive quotes in limit order books.
problem Optimal execution in limit order books with signal-dependent factors.
method Develops a unified solution theory for four execution criteria, incorporating signal-dependent drift, price impact, inventory risk, and execution risk.
result Explicit formulas reveal optimal quoting strategies and show signal-dependent drift can significantly affect execution.
New method reduces inventory inaccuracies by 10x, saving retailers 4% annually.
problem Inaccurate inventory records cost retailers 4% annually, and manual detection is impractical.
method Proposes a new anomaly detection method for low-rank Poisson matrices using cross-sectional data.
result Our approach reduces anomaly detection costs by up to 10x compared to existing methods.
Paper applies RL to optimize inventory management across multiple products and nodes.
problem Optimizing inventory management for a large number of products with shared capacity in a multi-node supply chain.
method Novel multi-agent hierarchical reinforcement learning framework with A2C algorithm and quantised action spaces.
result The approach optimizes for maximizing product sales and minimizing wastage of perishable products.
A large GPS dataset reveals that a single route often covers 60% of travel observations.
problem Limited insights from small GPS datasets on route choice behavior.
method Evaluation of path generation algorithms including link penalty, link elimination, simulation, and via-node methods.
result Modified link penalty method achieves 97% coverage, significantly higher than previous studies.
Global routing has been a historically challenging problem in electronic circuit design, where the challenge is to connect a large and arbitrary number of circuit components with wires without violating the design rules for the printed circuit boards or integrated circuits. Similar routing problems also exist in the de…
Apparently random financial fluctuations often exhibit varying levels of complexity, chaos. Given limited data, predictability of such time series becomes hard to infer. While efficient methods of Lyapunov exponent computation are devised, knowledge about the process driving the dynamics greatly facilitates the complex…
We propose and systematically evaluate three strategies for training dynamically-routed artificial neural networks: graphs of learned transformations through which different input signals may take different paths. Though some approaches have advantages over others, the resulting networks are often qualitatively similar…
A new router uses attention-based reinforcement learning to solve detailed routing problems efficiently.
problem Solving detailed routing in integrated circuits while adhering to complex design rules.
method Attention-based reinforcement learning applied to track-assignment detailed routing.
result The attention router achieves over 100x acceleration compared to a genetic router without sacrificing solution quality.
Central bank strategy to maintain currency exchange rate within limits.
problem Maintaining a currency exchange rate within a target zone despite adverse economic trends.
method Modeling the problem with a continuous-time market impact model and solving it as a stochastic control problem.
result Optimal strategy minimizes accumulated inventory of foreign currency.
Study on HFTs' interactions with a large trader using mean field game theory.
problem Interactions between high-frequency traders and a large trader executing assets at discrete times.
method Modeling HFTs' behavior using a jump process and solving the equilibrium through mean field game approach.
result Inventory-averse HFTs lower LT's costs when market impact is large.
Paper introduces privacy-preserving inventory policy learning for feature-based newsvendor with unknown demand.
problem Privacy-preserving inventory policy learning for feature-based newsvendor with unknown demand distribution and nonsmooth loss function.
method Developed a clipped noisy gradient descent algorithm based on convolution smoothing for optimal inventory estimation within f-differential privacy framework.
result Achieved privacy-preserving optimal inventory policy with provable privacy guarantees and desirable statistical precision.
The DEBS Grand Challenge 2018 is set in the context of maritime route prediction. Vessel routes are modeled as streams of Automatic Identification System (AIS) data points selected from real-world tracking data. The challenge requires to correctly estimate the destination ports and arrival times of vessel trips, as ear…
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…
Unified routing and arbitrage with concave continuation.
problem Combining routing and arbitrage in financial markets.
method Extending AMM trade functions to negative inputs via concave continuation.
result Unified approach unifies routing and arbitrage.