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.

168,695 papers · 148 categories

Trend · papers per month

51102153204 · Jun 202019922001200920172026
48 results for online pricing

Paper proposes a new dynamic pricing method with always-valid online statistical learning.

problem Designing dynamic pricing policies that adapt to online uncertainty and maintain validity.
method Regularized online statistical learning with theoretical guarantees and three major advantages.
result Proposed OORMLP pricing policy secures logarithmic regret in decision horizon.

Hybrid model predicts stock prices using online forum sentiments and popularity.

problem Predicting stock prices accurately considering investor sentiment.
method XLNET for sentiment analysis, BiLSTM-highway model integration, combining post popularity.
result Hybrid model outperforms traditional methods in stock price prediction.

A scalable system detects price anomalies in online marketplaces to improve customer experience.

problem Inaccurate prices on online marketplaces lead to poor customer experience and revenue loss.
method MoatPlus uses unsupervised statistical features and an ensemble of models to generate upper price bounds.
result Our approach improves precise anchor coverage by up to 46.6% in high-vulnerability item subsets.

New online method for multivariate probabilistic electricity price forecasting.

problem Multivariate probabilistic forecasting of electricity prices.
method Online multivariate distributional regression with LASSO regularization.
result Robust and interpretable joint prediction intervals for 24-hour electricity prices.

Optimal online learning for joint pricing and resource allocation.

problem Maximizing net profit in dynamic pricing and resource allocation with stochastic demand.
method Developed an efficient algorithm using a Lower-Confidence Bound (LCB) meta-strategy over multiple OCO agents.
result Achieved ildeO(Tmn) ilde{O}(\sqrt{Tmn}) regret, optimal with respect to time horizon TT.

We consider a context-based dynamic pricing problem of online products, which have low sales. Sales data from Alibaba, a major global online retailer, illustrate the prevalence of low-sale products. For these products, existing single-product dynamic pricing algorithms do not work well due to insufficient data samples.…

2019-02-17abs ↗pdf ↗

This paper addresses dynamic price discrimination with fairness constraints.

problem Dynamic price discrimination with fairness constraints in online retailing.
method Nonparametric demand models, dynamic pricing policy, regret minimization.
result Optimal dynamic pricing policy with ildeO(T4/5) ilde{O}(T^{4/5}) regret for price fairness.

Doubly fair dynamic pricing ensures equal prices for different groups over time.

problem Achieving equal prices for different groups in online dynamic pricing.
method Online learning algorithm that balances procedural and substantive fairness.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) regret, zero procedural unfairness, and ildeO(T) ilde{O}(\sqrt{T}) substantive unfairness.

A popular approach to selling online advertising is by a waterfall, where a publisher makes sequential price offers to ad networks for an inventory, and chooses the winner in that order. The publisher picks the order and prices to maximize her revenue. A traditional solution is to learn the demand model and then subseq…

2019-04-20abs ↗pdf ↗

We consider revenue maximization in online auction/pricing problems. A seller sells an identical item in each period to a new buyer, or a new set of buyers. For the online posted pricing problem, we show regret bounds that scale with the best fixed price, rather than the range of the values. We also show regret bounds …

2017-05-26abs ↗pdf ↗

This paper tackles optimal bidding strategies in adversarial first-price auctions.

problem How to bid optimally and efficiently in adversarial first-price auctions.
method Developed a minimax optimal online bidding algorithm leveraging expert-chaining structure and exploiting product structure.
result Achieved an O~(T)\widetilde{O}(\sqrt{T}) regret, superior to existing algorithms.

Some online advertising offers pay only when an ad elicits a response. Randomness and uncertainty about response rates make showing those ads a risky investment for online publishers. Like financial investors, publishers can use portfolio allocation over multiple advertising offers to pursue revenue while controlling r…

2015-06-05abs ↗pdf ↗

Study online pricing with contextual elasticity and heteroscedastic valuation.

problem Online contextual dynamic pricing with customer decision based on features and price.
method Introduced a novel approach to modeling customer demand with feature-based price elasticity and heteroscedastic noise. Proposed an efficient algorithm called Pricing with Perturbation (PwP).
result Proved an O(dTlogT)O(\sqrt{dT\log T}) regret bound for the algorithm, matching a lower bound of Ω(dT)Ω(\sqrt{dT}).

Two algorithms achieve optimal logarithmic regret in feature-based dynamic pricing.

problem Optimal pricing for products with features based on online learning.
method Developed EMLP and ONSP algorithms for stochastic and adversarial settings, proving O(dlogT)O(d\log{T}) regret bounds.
result Achieved optimal O(dlogT)O(d\log{T}) regret, improving over existing bounds.

The real estate market is exposed to many fluctuations in prices because of existing correlations with many variables, some of which cannot be controlled or might even be unknown. Housing prices can increase rapidly (or in some cases, also drop very fast), yet the numerous listings available online where houses are sol…

2018-09-13abs ↗pdf ↗

We introduce a local volatility model for the valuation of options on commodity futures by using European vanilla option prices. The corresponding calibration problem is addressed within an online framework, allowing the use of multiple price surfaces. Since uncertainty in the observation of the underlying future price…

2016-02-13abs ↗pdf ↗

New method learns decisions from collective preferences without individual covariates.

problem Making decisions online without individual covariates.
method Collaborative filtering, matrix completion bandit, ε-greedy policy, online gradient descent, inverse propensity weighting.
result Method outperforms benchmarks and reveals new discoveries.

Study shows observing order book can significantly improve online market making performance.

problem Online market making with private valuations and limited feedback.
method Introduces action-dependent feedback model and proposes elimination-based and explore-then-perturb algorithms.
result Achieves O(T)O(\sqrt{T}) regret bounds with high probability in various settings.

COAD maximizes online auction revenue by quantifying uncertainty without known distributions.

problem Designing incentive-compatible mechanisms for online auctions with unknown bidder values and uncertain future participants.
method COAD uses distribution-free uncertainty quantification techniques and integrates machine learning methods to predict bidder values while ensuring revenue guarantees.
result COAD maximizes revenue in online auctions through bidder-specific reserve prices based on lower confidence bounds of valuations.

Study strategic dynamic pricing for buyers with unknown manipulation costs.

problem Strategic buyers manipulate their features to get lower prices, hindering profit maximization.
method Proposes a strategic dynamic pricing policy that incorporates strategic behavior and binary response data.
result Achieves sublinear regret bound of O(T)O(\sqrt{T}) compared to linear Ω(T)Ω(T) regret of non-strategic policies.

Multiple machine learning and prediction models are often used for the same prediction or recommendation task. In our recent work, where we develop and deploy airline ancillary pricing models in an online setting, we found that among multiple pricing models developed, no one model clearly dominates other models for all…

2019-05-21abs ↗pdf ↗

Study shows how price protection affects online learning algorithms for dynamic pricing.

problem Impact of price protection guarantee on online learning algorithms for dynamic pricing.
method Characterized the effect of price protection period length on optimal regret, proposed LEAP algorithm.
result Optimal regret is Θ(√T + min{M, T^2/3}) with LEAP matching lower bounds up to logarithmic factors.

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 ↗

Study forecasts vegetable prices in Nepal using a novel index and ensemble model.

problem High volatility and cultural influences on agricultural commodity prices.
method Developed KVPI, created features, evaluated multiple models, introduced Momentum-Corrected Online Stacking Ensemble.
result Achieved RMSE of 1.771, MAPE of 0.68%, and R-squared of 0.845 at 90-day horizon.

Paper proposes using online text data to predict CPI with LLMs.

problem Forecasting Consumer Price Index (CPI) using low-frequency survey-based data.
method Develops an LLM-based approach combining online text time series with monthly CPI data.
result Establishes the asymptotic properties and provides prediction intervals for CPI forecasts.

The paper tackles online learning problems with monotone arm sequences, achieving optimal or near-optimal regret bounds.

problem Online learning problems with ordinal and monotone arm sequences, such as dynamic pricing and clinical trials.
method Proposes algorithms for continuum-armed bandit problems with monotone arm sequences, achieving optimal or near-optimal regret bounds.
result Achieves optimal or near-optimal regret bounds for monotone arm sequences, differing from the continuous-armed bandit literature.