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

70140210280 · Jun 202019922001200920172026
48 results for revenue dynamics

This paper optimizes multi-channel sequential advertising to maximize cumulative revenue.

problem Maximizing cumulative revenue in multi-channel sequential advertising under a budget constraint.
method Formulated as a dynamic knapsack problem, proposed a bilevel optimization framework with action space reduction.
result Significantly improved cumulative revenue compared to state-of-the-art baselines.

Unfair pricing policies have been shown to be one of the most negative perceptions customers can have concerning pricing, and may result in long-term losses for a company. Despite the fact that dynamic pricing models help companies maximize revenue, fairness and equality should be taken into account in order to avoid u…

2018-03-27abs ↗pdf ↗

Contextual bandit framework improves revenue optimization in securities lending market.

problem Optimizing revenue for agent lenders in a dynamic securities lending market.
method Utilized contextual bandit frameworks to address dynamic pricing problems in an e-commerce-like securities lending market.
result Contextual bandit approach consistently outperforms traditional methods by at least 15% in total revenue generated.

Dynamic pricing improves DeFi lending efficiency by reducing regret to logarithmic levels.

problem Static pricing mechanisms in DeFi lending protocols lead to suboptimal welfare and revenue.
method Online learning model for static and dynamic pricing models in DeFi lending.
result Adaptive supply models achieve logarithmic regret, outperforming static models.

For any business, planning is a continuous process, and typically business-owners focus on making both long-term planning aligned with a particular strategy as well as short-term planning that accommodates the dynamic market situations. An ability to perform an accurate financial forecast is crucial for effective plann…

2016-11-21abs ↗pdf ↗

The paper analyzes risks and revenue dynamics of a liquid restaking protocol in decentralized finance.

problem Interconnected risks and revenue dynamics of a liquid restaking protocol in decentralized finance.
method Empirical analysis using OLS regression, Granger-causality, and random forest feature importance tests.
result Revenue is primarily driven by value locked in the ecosystem, yield of liquid restaking token, and multi-blockchain expansion.

Ancillaries have become a major source of revenue and profitability in the travel industry. Yet, conventional pricing strategies are based on business rules that are poorly optimized and do not respond to changing market conditions. This paper describes the dynamic pricing model developed by Deepair solutions, an AI te…

2019-02-06abs ↗pdf ↗

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 ↗

Paper shows re-solving heuristics have constant regret for price-based revenue management.

problem Optimal pricing policies for revenue management with time constraints.
method Proves re-solving heuristics have O(1)O(1) regret compared to optimal policies.
result Improved regret bound to O(1)O(1) from O(lnT)O(\ln T), complemented by Ω(lnT)Ω(\ln T) gap with fluid model.

We study the problem of dynamic assortment personalization with large, heterogeneous populations and wide arrays of products, and demonstrate the importance of structural priors for effective, efficient large-scale personalization. Assortment personalization is the problem of choosing, for each individual (type), a bes…

2016-10-18abs ↗pdf ↗

High-frequency trading strategy boosts battery storage profits.

problem Maximizing revenue for battery energy storage systems in intraday markets.
method Adapted dynamic programming for continuous intraday markets, considering limit order book dynamics.
result Dynamic programming strategy outperforms standard re-optimization methods, increasing profits by 58% and 14% respectively.

Optimizes trade execution with reinforcement learning for limit orders.

problem Maximizing revenue in a limit order book with market and limit orders.
method Formulated as a dynamic allocation task, uses multivariate logistic-normal distributions for efficient training.
result Outperforms traditional strategies in simulated environments.

Proposes a variational autoencoder for long-term customer revenue forecasting.

problem Predicting long-term customer revenue from sparse and irregular transaction data.
method Variational Autoencoder (VAE) with flexible latent representation.
result Improves upon latest benchmarks in multiple real-world datasets.

We study a stylized dynamic assortment planning problem during a selling season of finite length TT. At each time period, the seller offers an arriving customer an assortment of substitutable products and the customer makes the purchase among offered products according to a discrete choice model. The goal of the selle…

2018-06-27abs ↗pdf ↗

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.

Paper tackles dynamic assortment with dual contexts, improving revenue in e-commerce.

problem Maximizing revenue in e-commerce with personalized recommendations from vast catalogs.
method Low-rank dynamic assortment model and upper confidence bound approach.
result Regret bound of ildeO((d1+d2)rT) ilde{O}((d_1+d_2)r\sqrt{T}) for dynamic assortment problem.

We consider a firm that sells products over TT periods without knowing the demand function. The firm sequentially sets prices to earn revenue and to learn the underlying demand function simultaneously. A natural heuristic for this problem, commonly used in practice, is greedy iterative least squares (GILS). At each ti…

2016-04-25abs ↗pdf ↗

Dynamic pricing learns demand model from sparse product networks.

problem Minimizing revenue loss in a large network of products with unknown demand parameters.
method Combines optimism-in-the-face-of-uncertainty and PAC-Bayesian approaches.
result Achieves asymptotically optimal performance in terms of network size and time horizon.

Germany's tax admin costs likely exceed 20% of total revenue, requiring system improvement.

problem High tax administrative costs in Germany and other jurisdictions.
method Statistical data, surveys, and a novel approach to measure total administrative cost as a percentage of total tax revenue.
result Germany's 2021 tax administrative costs likely exceeded 20% of total tax revenue.

The paper proposes a new method for product recommendation that considers revenue contributions and user similarity.

problem High dimensionality and sparsity in user-item data, especially in terms of revenue contributions.
method The approach encodes revenue contributions in the user-item matrix and computes customer similarity using suitable distance measures.
result The method segments users based on revenue-based similarity and supports recommendations aligned with profitability objectives.

'There is no terror in the bang, only is the anticipation of it' - Alfred Hitchcock. Yet there is everything in correctly anticipating the bang a movie would make in the box-office. Movies make a high profile, billion dollar industry and prediction of movie revenue can be very lucrative. Predicted revenues can be used …

2018-04-03abs ↗pdf ↗

This paper studies how AMMs can minimize losses from arbitrage while retaining uninformed trading activity.

problem Minimizing losses from arbitrage in AMMs while retaining uninformed trading activity.
method Modeling arbitrage dynamics and sensitivity to fee choices, mapping to a random walk with a reward scheme.
result AMMs can maximize value retention by optimizing fee structures.

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.

In E-commerce advertising, where product recommendations and product ads are presented to users simultaneously, the traditional setting is to display ads at fixed positions. However, under such a setting, the advertising system loses the flexibility to control the number and positions of ads, resulting in sub-optimal p…

2018-09-10abs ↗pdf ↗

This study improves valuation of post-revenue biopharmaceutical assets using Pfizer's data.

problem Accurate valuation of post-revenue drug assets in biotech and pharma.
method Historical sales data analysis to forecast future sales and calculate Net Present Value.
result Demonstrates a method for more informed investment decisions in biotech and pharma.

Proposes balancing revenue and environmental impact in assortment planning.

problem Maximizing revenue while considering environmental impact in retail assortment planning.
method Multi-objective optimization using Higg Material Sustainability Index.
result Shows it's possible to have lower environmental impact without significant revenue loss.

The study uses historical revenue data to forecast music catalog cashflows and multipliers.

problem Valuation of music catalogs based on historical revenue data.
method Risk-neutral approach using discounted cashflows formula.
result Ask prices are close to multipliers justified by median song cashflows, while best bids are near multipliers justified by bottom decile cashflows.