Solves inventory control with unknown demand trend using singular control.
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.
Trend · papers per month
Policy certifies inventory levels meeting service requirements.
The paper tackles revenue management with time-varying demand using posterior sampling.
New algorithm adapts to unknown demand smoothness for dynamic pricing.
Inventory control with unknown demand distribution is considered, with emphasis placed on the case involving discrete nonperishable items. We focus on an adaptive policy which in every period uses, as much as possible, the optimal newsvendor ordering quantity for the empirical distribution learned up to that period. Th…
Improved algorithm reduces regret in NRM with unknown demand.
Study on inventory control with changing demand, proposing adaptive algorithms.
We consider a stochastic inventory control problem under censored demands, lost sales, and positive lead times. This is a fundamental problem in inventory management, with significant literature establishing near-optimality of a simple class of policies called ``base-stock policies'' for the underlying Markov Decision …
This paper addresses privacy issues in personalized pricing using nonparametric demand models.
Motivated by posted price auctions where buyers are grouped in an unknown number of latent types characterized by their private values for the good on sale, we investigate revenue maximization in stochastic dynamic pricing when the distribution of buyers' private values is supported on an unknown set of points in [0,1]…
Paper introduces privacy-preserving inventory policy learning for feature-based newsvendor with unknown demand.
Dynamic pricing policy converges to Nash equilibrium with low regret.
New approach uses deep generative models for inventory and pricing decisions.
ODC protocol improves learning in asynchronous multi-agent bandits.
We consider a fundamental dynamic allocation problem motivated by the problem of in financial markets, the mechanism underlying the short selling of stocks. A lender would like to distribute a finite number of identical copies of some scarce resource to clients, each of whom has a priv…
New mixture models for clustering and density estimation of unknown distributions.
We consider the problem of a firm seeking to use personalized pricing to sell an exogenously given stock of a product over a finite selling horizon to different consumer types. We assume that the type of an arriving consumer can be observed but the demand function associated with each type is initially unknown. The fir…
A new algorithm for competing agents in a two-sided market setting.
Bayesian neural networks' performance varies with prior choice, affecting their ability to identify unknowns.
We present a novel methodology able to distinguish meaningful level shifts from typical signal fluctuations. A two-stage regularization filtering can accurately identify the location of the significant level-shifts with an efficient parameter-free algorithm. The developed methodology demands low computational effort an…
This paper addresses dynamic price discrimination with fairness constraints.
Supplier learns to price contracts against a learning retailer.
This paper studies the impact of limited switches on resource-constrained dynamic pricing with demand learning. We focus on the classical price-based blind network revenue management problem and extend our results to the bandits with knapsacks problem. In both settings, a decision maker faces stochastic and distributio…
New adaptive test for NPIV models controls size and has superior power.
We study the problem of learning shared structure \emph{across} a sequence of dynamic pricing experiments for related products. We consider a practical formulation where the unknown demand parameters for each product come from an unknown distribution (prior) that is shared across products. We then propose a meta dynami…
Demand variance can result in a mismatch between planned supply and actual demand. Demand shaping strategies such as pricing can be used to shift elastic demand to reduce the imbalance. In this work, we propose to consider elastic demand in the forecasting phase. We present a method to reallocate the historical elastic…
The design of personalized incentives or recommendations to improve user engagement is gaining prominence as digital platform providers continually emerge. We propose a multi-armed bandit framework for matching incentives to users, whose preferences are unknown a priori and evolving dynamically in time, in a resource c…
Safe linear bandits over unknown polytopes avoid safety violations and suboptimal actions.
The paper proposes a new model to better estimate demand from censored data.
Demand functions for goods are generally cyclical in nature with characteristics such as trend or stochasticity. Most existing demand forecasting techniques in literature are designed to manage and forecast this type of demand functions. However, if the demand function is lumpy in nature, then the general demand foreca…
ECP optimizes expensive functions without knowing Lipschitz constant.
In this paper, we combine ideas from machine learning (ML) and operations research and management science (OR/MS) in developing a framework, along with specific methods, for using data to prescribe optimal decisions in OR/MS problems. In a departure from other work on data-driven optimization and reflecting our practic…
Transport demand is highly dependent on supply, especially for shared transport services where availability is often limited. As observed demand cannot be higher than available supply, historical transport data typically represents a biased, or censored, version of the true underlying demand pattern. Without explicitly…
Study improves cross-modal bike-share and transit demand prediction.
A new metric optimizes forecasts for lumpy, intermittent demand.
Paper develops privacy-preserving dynamic pricing policy for e-commerce.
Statistical arbitrageurs have inelastic demand, contrary to classical models.
Safe-M-UCRL learns safe policies for multi-agent systems with global constraints.
We consider adaptive control of the Linear Quadratic Regulator (LQR), where an unknown linear system is controlled subject to quadratic costs. Leveraging recent developments in the estimation of linear systems and in robust controller synthesis, we present the first provably polynomial time algorithm that provides high…
Implementing a set of microeconomic criteria, we develop price dynamics equations using a function of demand/supply with key symmetry properties. The function of demand/supply can be linear or nonlinear. The type of function determines the nature of the tail of the distribution based on the randomness in the supply and…
We study the application of dynamic pricing to insurance. We view this as an online revenue management problem where the insurance company looks to set prices to optimize the long-run revenue from selling a new insurance product. We develop two pricing models: an adaptive Generalized Linear Model (GLM) and an adaptive …
Paper introduces Decentralized Non-stationary Competing Bandits ( exttt{DNCB}) for dynamic matching markets.
Recommending the right products is the central problem in recommender systems, but the right products should also be recommended at the right time to meet the demands of users, so as to maximize their values. Users' demands, implying strong purchase intents, can be the most useful way to promote products sales if well …
Novel probabilistic models forecast residential heating and electricity demand at hourly resolution.
Two neural network models analyze bus system efficiency and demand.
This paper investigates the impact of pre-existing offline data on online learning, in the context of dynamic pricing. We study a single-product dynamic pricing problem over a selling horizon of periods. The demand in each period is determined by the price of the product according to a linear demand model with unkn…
Heat demand prediction is a prominent research topic in the area of intelligent energy networks. It has been well recognized that periodicity is one of the important characteristics of heat demand. Seasonal-trend decomposition based on LOESS (STL) algorithm can analyze the periodicity of a heat demand series, and decom…
Intermittent demand, where demand occurrences appear sporadically in time, is a common and challenging problem in forecasting. In this paper, we first make the connections between renewal processes, and a collection of current models used for intermittent demand forecasting. We then develop a set of models that benefit…