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

Trend · papers per month

3775112149 · Jun 202019922001200920172026
48 results for expected revenue

New loss functions optimize pricing policies using transaction data, ensuring expected revenue guarantees.

problem Optimizing pricing policies with transaction data where valuation data is not directly observed.
method Introducing convex loss functions for contextual pricing, focusing on log-concave valuation distributions.
result Proved expected revenue bounds for generalized hinge and quantile pricing loss functions.

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 ↗

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

We study a novel multi-armed bandit problem that models the challenge faced by a company wishing to explore new strategies to maximize revenue whilst simultaneously maintaining their revenue above a fixed baseline, uniformly over time. While previous work addressed the problem under the weaker requirement of maintainin…

2016-02-13abs ↗pdf ↗

Study optimal auction formats for maximizing MEV on Ethereum.

problem Maximizing extractable value from Ethereum auctions.
method Empirical analysis of 2.2 million transactions, modeling affiliation among bidders.
result English and second-price sealed-bid auctions dominate other formats, with significant revenue losses.

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.

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.

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.

Permutation-equivariant neural networks improve auction mechanisms by reducing regret and sample complexity.

problem Designing optimal auction mechanisms that balance revenue and bidders' regret.
method Introduced permutation-equivariant neural networks to auction mechanisms.
result Permutation-equivariant neural networks decrease expected ex-post regret and improve model generalizability.

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 ↗

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 ↗

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 ↗

Algorithm maximizes revenue-risk by estimating price impact kernel and optimizing control problems.

problem Maximizing revenue-risk in a risky asset liquidation with unknown price impact.
method Alternates exploration and exploitation phases, uses novel kernel estimation and stability results.
result Sublinear regret achieved with high probability.

We consider the problem of a single seller repeatedly selling a single item to a single buyer (specifically, the buyer has a value drawn fresh from known distribution DD in every round). Prior work assumes that the buyer is fully rational and will perfectly reason about how their bids today affect the seller's decisio…

2017-11-25abs ↗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.

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

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.

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.

We investigate the problem of optimal dividend distribution for a company in the presence of regime shifts. We consider a company whose cumulative net revenues evolve as a Brownian motion with positive drift that is modulated by a finite state Markov chain, and model the discount rate as a deterministic function of the…

2008-12-29abs ↗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.

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.