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,742 papers · 148 categories

Trend · papers per month

0.9%1.9%2.8%3.8% · Feb 200219922001200920172026
48 results for historical revenue

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.

'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 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.

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.

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.

Paper uses DRL for dynamic pricing on e-commerce platforms.

problem Dynamic pricing on e-commerce platforms.
method Deep reinforcement learning, Markov Decision Process (MDP), continuous price sets, difference of revenue conversion rates (DRCR).
result DRCR is a more appropriate reward function than revenue.

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.

Proposes robust assortment optimization from observational data.

problem Real-world scenarios often violate assumptions of stable customer preferences and correct choice models.
method Develops a robust framework that accounts for potential distributional shifts in customer choice behavior.
result Uncovered the notion of ``robust item-wise coverage'' as the minimal data requirement for sample-efficient robust assortment learning.

This study examines yield aggregators in DeFi, summarizing strategies and analyzing performance.

problem Understanding and optimizing yield farming strategies in DeFi.
method Summarizes yield farming protocols and tokens, analyzes performance through simulations and empirical data.
result Plausible connection between data anomalies and historical events in yield aggregators.

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 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 ↗

The paper introduces revenue uplift modeling to maximize marketing profits.

problem Maximizing incremental sales versus maximizing incremental revenue in marketing campaigns.
method Response transformation and two-stage models to decompose campaign profit.
result Revenue uplift modeling can improve campaign profit substantially.

In this paper we apply active learning algorithms for dynamic pricing in a prominent e-commerce website. Dynamic pricing involves changing the price of items on a regular basis, and uses the feedback from the pricing decisions to update prices of the items. Most popular approaches to dynamic pricing use a passive learn…

2018-02-08abs ↗pdf ↗

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.

Personalized pricing analytics is becoming an essential tool in retailing. Upon observing the personalized information of each arriving customer, the firm needs to set a price accordingly based on the covariates such as income, education background, past purchasing history to extract more revenue. For new entrants of t…

2018-05-03abs ↗pdf ↗

Paper optimizes liquidity provision in decentralized finance markets.

problem Strategic LPs face predictable losses and concentration risk in CL pools.
method Derive optimal liquidity provision strategy based on fees, PL, and concentration risk.
result Optimal strategy increases fee revenue and profit from marginal rate changes.

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.

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.

Before A/B testing online a new version of a recommender system, it is usual to perform some offline evaluations on historical data. We focus on evaluation methods that compute an estimator of the potential uplift in revenue that could generate this new technology. It helps to iterate faster and to avoid losing money b…

2018-01-22abs ↗pdf ↗

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 ↗

This paper improves bidding price prediction for ancillary services markets, boosting revenues.

problem Volatility in renewable energy sources affects grid stability and revenue optimization.
method Machine learning models (SVR, DT, k-NN) and offset adjustment for pay-as-bid markets.
result The proposed approach increases potential revenues by 27.43% to 37.31% compared to baseline models.

In markets for online advertising, some advertisers pay only when users respond to ads. So publishers estimate ad response rates and multiply by advertiser bids to estimate expected revenue for showing ads. Since these estimates may be inaccurate, the publisher risks not selecting the ad for each ad call that would max…

2015-06-05abs ↗pdf ↗

This work studies learning curves for revenue maximization algorithms.

problem Understanding the performance of revenue-maximizing algorithms as they learn from more data.
method Initiates the study of learning curves for revenue maximization, providing a near-complete characterization of their rate of decay.
result Learning curves for revenue maximization can decay arbitrarily slowly or almost exponentially fast, depending on the distribution and optimal revenue.

A new RL approach optimizes reserve prices in multi-phase auctions, reducing revenue regret.

problem Optimizing reserve prices in multi-phase second-price auctions with noisy and potentially untruthful bidders.
method Combines RL techniques with buffer periods, a novel algorithm, and LSVI-UCB extension.
result Achieves optimal revenue regret under known and unknown noise conditions.

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.

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.

OTT services are replacing traditional telecom services, affecting revenue streams.

problem OTT services are reducing traditional telecom revenue streams.
method Quantitative analysis of mobile user trends and revenue changes.
result OTT services are becoming more prevalent and impacting telecom revenue.