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 ~ ( N 5 / 2 T ) \widetilde O(N^{5/2}\sqrt{T}) O ( N 5/2 T ) for revenue maximization and balancing. 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) O ( 1 ) regret compared to optimal policies. result Improved regret bound to O ( 1 ) O(1) O ( 1 ) from O ( ln T ) O(\ln T) O ( ln T ) , complemented by Ω ( ln T ) Ω(\ln T) Ω ( 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.
Analyzes retail trends from sales, search, and reviews.
problem Optimizing inventory and marketing for better customer satisfaction.
method Historical sales data, search trends, and customer reviews.
result Identifies patterns and trending products for retailers.
A new RL method improves revenue management with delayed feedback.
problem Delayed feedback in revenue management affects substantial value.
method Choice-model-assisted Q-learning for delayed feedback revenue management.
result Q-learning with model-imputed targets converges to an optimal Q-function.
Study on revenue management with limited switches, achieving strong performance and reduced switch counts.
problem Resource-constrained dynamic pricing with limited switching constraints.
method Developed algorithms for blind network revenue management and bandits with knapsacks, achieving optimal regret rates.
result Optimal regret rates are fully characterized by a piecewise-constant function of the switching budget and resource constraints.
This paper improves online ad revenue by optimizing auction performance directly.
problem Disconnection between ad ranking and auction performance in online advertising.
method Proposes new loss functions and ranking functions to maximize revenue.
result Proposed methods outperform state-of-the-art in maximizing platform revenue.
A scalable model estimates revenue uncertainty for SMEs.
problem Estimating revenue uncertainty for SMEs to manage credit limits.
method Scalable Natural Gradient Boosting Machines.
result The method distinguishes accurate from inaccurate revenue forecasts.
A new AMM mechanism reduces losses and maximizes revenue from orderflows.
problem Reduces losses to informed orderflow and maximizes revenue from uninformed orderflow.
method Runs an onchain auction for pool manager role, allowing fee setting and price sensitivity.
result Proves higher liquidity in equilibrium compared to standard AMMs.
Estimates price sensitivity from transaction data using a novel odds ratio method.
problem Estimate price sensitivity from transaction-level data with partially observed treatment assignments.
method Recursive partitioning procedure with adversarial imputation for robust estimation.
result Validated on synthetic data and applied to three case studies, demonstrating heterogeneity in treatment effects.
Improved algorithm reduces regret in NRM with unknown demand.
problem Optimizing prices for products with limited resources under unknown demand.
method Primal-dual optimization with demand balancing.
result Improved regret bound of O ( N 3.25 T ) O(N^{3.25}\sqrt{T}) O ( N 3.25 T ) . The Dynamic Pricing Challenge revealed varying algorithm performance across different market dynamics.
problem Complexity of pricing and learning in competitive markets.
method Participants submitted pricing and demand learning algorithms for numerical performance analysis in simulated environments.
result Algorithm performance varies significantly across different market dynamics.
Study analyzes risk management in Aave and Compound lending protocols, finding v3 better than v2.
problem Risk management in decentralized lending protocols.
method Cross-version and cross-chain analysis using fixed effects model.
result v3 protocols have better risk management, with stronger impact on L2 blockchains.
Optimizes real estate prices with dynamic strategies.
problem Optimizing prices for limited real estate goods over time.
method Develops a mathematical model considering variable demand, time value, and growth of real estate value.
result Enhanced model for better revenue management in real estate.
The study analyzes how cross-chain interoperability affects decentralized lending protocols' performance.
problem Understudied cross-chain elements in DeFi lending risk management.
method Panel regression fixed effects and OLS models applied to empirical analysis.
result Cross-chain activity impacts protocol performance, with bridge volume being a critical driver.
New framework forecasts both supply and demand in rental markets.
problem Booking models ignore supply, leading to regime-specific ceilings.
method Three-part coupling framework (behavioral, informational, intervention).
result Booking models learn a regime-specific ceiling and become fragile.
Research optimizes a small RES utility's portfolio by dynamically trading in German electricity markets.
problem Managing risks in RES producers and electricity traders in changing electricity markets.
method Uses SVAR model to estimate market relationships and data-driven trading strategies to optimize revenue and reduce risk.
result Data-driven trading strategies increase utility revenue and reduce trading risk.
Deep RL for dynamic pricing of express lanes considers multiple origins, destinations, and access locations.
problem Dynamic pricing of express lanes with multiple access points and traveler heterogeneity.
method Formulated as a POMDP, uses policy gradient methods and neural networks to determine stochastic tolls.
result Deep RL outperforms traditional methods in maximizing revenue and minimizing travel time.
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…
Adaptive pricing models for insurance using GLMs and GP regression.
problem Optimizing revenue from new insurance products.
method Developed two adaptive pricing models: GLM and Gaussian Process (GP) regression.
result The adaptive GLM and GP models reduce revenue loss compared to static pricing.
Paper refines first-order method complexity by considering lingering gradients.
problem Improving the time complexity of first-order methods.
method Integrates the concept of lingering gradients to refine method complexity.
result Gradient descent convergence rate improved from 1/T to exp(-T^1/3).
Financial institutions face new model risks with AI, requiring enhanced model risk management.
problem New model risks from Generative AI applications in financial institutions.
method Enhanced model risk framework with additional testing and controls.
result Financial institutions need to enhance their model risk management for Generative AI applications.
Study uses VC correlation to uncover directional financial relationships.
problem Understanding causal relationships between financial variables.
method Volatility constrained correlation (VC correlation) method.
result Operating income is most influential, while market capitalization and revenue are most susceptible.
HL algorithms improve resource allocation in cloud environments.
problem Sequential decision-making under uncertainty with exogenous variables.
method HL algorithms leverage exogenous variable samples to infer counterfactual consequences.
result HL algorithms outperform classic methods and reinforcement learning in resource allocation.
Study dynamic assortment planning under nested logit models for revenue maximization.
problem Maximize revenue by dynamically selecting assortments of products during a selling season.
method Developed a novel UCB policy that learns and makes decisions based on customers' choice behavior.
result Achieved accumulated regret of i l d e O ( M N T ) ilde{O}(\sqrt{MNT}) i l d e O ( M N T ) with a lower bound of Ω ( M T ) Ω(\sqrt{MT}) Ω ( M T ) . Optimal policy for dynamic assortment planning under MNL model with O ( T ) O(\sqrt{T}) O ( T ) regret.
problem Maximizing revenue in dynamic assortment planning under MNL model with unknown parameters.
method Trisection-based policy with adaptive confidence bounds.
result Achieves O ( T ) O(\sqrt{T}) O ( T ) regret bound, independent of the number of products. Biotech startups are found to be similar to tech startups overall.
problem The uniqueness of biotech startups was previously overemphasized.
method Extensive research from new databases analyzed similarities and differences.
result Biotech startups share similarities in venture capital, exit time, and geography with tech startups.
We analyze annual revenues and earnings data for the 500 largest-revenue U.S. companies during the period 1954-2007. We find that mean year profits are proportional to mean year revenues, exception made for few anomalous years, from which we postulate a linear relation between company expected mean profit and revenue. …
Research funding agencies routinely use a proportion of their total revenues to support internal administration and marketing costs. The ratio of administration to total costs, referred to as the administration ratio, is highly variable and within any single fund depends on many factors including the number and average…
Study shows local governments smooth fiscal shocks from property tax revenues.
problem Impact of revenue shocks on local fiscal policy.
method Causal machine learning strategies and post-double-selection LASSO estimator.
result Local policymakers predominantly smooth fiscal shocks, but react differently to positive and negative shocks.
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.
Model analyzes competitive pricing strategies in large markets of perishable products.
problem Maximizing profits in a competitive market of perishable products.
method Mean-field competition model, Hamilton-Jacobi-Bellman equation, iterative numerical algorithm.
result Properties of equilibrium pricing strategies and market dynamics.
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.
Paper forecasts tax revenues in Bulgaria during pandemic.
problem Forecasting tax revenues during pandemic.
method Model based on IMF recommendations, using 1995-2019 data.
result Pandemic negatively impacts tax revenues, but econometrics can still produce forecasts.
The paper targets optimal interventions for long-term outcomes using imputed data and policy learning.
problem Maximizing long-term outcomes observed only in the future.
method Imputing missing long-term outcomes and using a doubly-robust approach for policy evaluation and optimization.
result The approach outperforms simple short-term proxies and achieves significant revenue impact over three years.
A new model predicts fashion demand 6-12 months ahead, boosting retailer profits.
problem Accurate demand forecasting for fashion retailers with short product life cycles.
method Product age-based forecast model, incorporating unique feature engineering.
result Significant revenue uplift of 41% compared to retailer's plan.
Optimizes cash management in ATM networks to reduce costs and increase revenue.
problem Minimizing cash costs while ensuring adequate funds in a network of ATMs.
method Developed a discrete optimal control model using forecasting techniques and control theory.
result The proposed model outperforms classical inventory management models, earning 30% more revenue.
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.
Predicting movie box office success using historical data and modern computing.
problem Manual prediction of movie revenue is difficult due to many exogenous variables.
method Use modern computing power and historical data to model movie revenue.
result Predicted movie revenues can be used for planning production and distribution stages.
We have conducted an agent-based simulation of chain bankruptcy. The propagation of credit risk on a network, i.e., chain bankruptcy, is the key to nderstanding largesized bankruptcies. In our model, decrease of revenue by the loss of accounts payable is modeled by an interaction term, and bankruptcy is defined as a ca…
Study finds tax avoidance and IT issues hinder revenue in Gombe state.
problem Problems of personal income tax on revenue generation in Gombe state.
method Survey with primary and secondary data, chi square test.
result Tax avoidance and IT issues are major problems.
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.
Research analyzes Georgia's tax system and suggests improvements.
problem Improving tax revenues in Georgia's state budget.
method Analysis of past and present tax systems, review of influencing factors, comparison of foreign models.
result Stimulating measures can increase tax revenues for Georgia's state budget.
Model for dynamic pricing across multiple RE groups to maximize revenue.
problem Maximizing revenue from multiple RE pricing groups.
method Mathematical model incorporating multiple pricing groups, revenue goals, and time value of money.
result Algorithm for constructing a pricing policy for multiple RE groups.
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 i l d e O ( ( d 1 + d 2 ) r T ) ilde{O}((d_1+d_2)r\sqrt{T}) i l d e O (( d 1 + d 2 ) r T ) for dynamic assortment problem. Study on tax administration issues and their impact on Georgia's budget revenues.
problem Problems in revenue administration and tax rates in Georgia.
method Analyzed foreign experience and proposed a progressive tax system.
result A progressive tax system would benefit Georgia's business and economy.
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.