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. 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…
Paper proposes a fair stock trading strategy using multi-agent reinforcement learning.
problem Unfair stock trading strategies lead to long-term losses for companies.
method Multi-agent reinforcement learning system to balance revenue and fairness.
result The system optimizes individual revenue while maintaining fairness.
Market incentivizes parties to share high-quality data for collaborative machine learning tasks.
problem Fair revenue distribution and data replication threats in collaborative machine learning markets.
method Introduces a novel payment division function robust to replication and customized output models.
result Validated assumptions and showed approximate satisfaction for commonly used models.
The paper explores fairness, welfare, and equity in personalized pricing across various applications.
problem Interplay of fairness, welfare, and equity in personalized pricing based on customer features.
method Comprehensive literature review and observational metrics without underlying valuation distribution assumptions.
result Personalized pricing can expand access, improve welfare, and increase revenue or budget utilization.
A new mechanism optimizes data marketplace pricing efficiently.
problem Designing fair and efficient pricing mechanisms for data marketplaces.
method Two-stage approach: auctions to estimate value distributions, then optimal posted prices.
result MAPP achieves optimal revenue with minimal price discrimination.
The paper proves ADL mechanisms face a trilemma and optimizes them for fairness, revenue, and exchange solvency.
problem The impossibility of a perpetual futures exchange achieving solvency, revenue, and fairness.
method Formal model of ADL, proving trilemma, and analyzing three ADL mechanisms.
result Optimized ADL mechanisms can reduce trader losses while maintaining exchange solvency.
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 i l d e O ( T 4 / 5 ) ilde{O}(T^{4/5}) i l d e O ( T 4/5 ) regret for price fairness. Simplifies complex pricing models for better interpretability and revenue.
problem Complex pricing models are hard to interpret and not widely adopted.
method Model distillation to create interpretable pricing policies.
result Maximizes revenue while maintaining interpretability.
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. …
New auction design uses statistical learning to reduce costs and improve fairness.
problem Designing efficient multi-item auctions with reduced implementation costs and fairness.
method Nonparametric density estimation for credible intervals, two new strategies.
result Strategies consistently outperform alternative methods in revenue maximization and cost reduction.
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 i l d e O ( T ) ilde{O}(\sqrt{T}) i l d e O ( T ) regret, zero procedural unfairness, and i l d e O ( T ) ilde{O}(\sqrt{T}) i l d e O ( T ) substantive unfairness. Study learns optimal auctions from corrupted or perturbed bidder valuation samples.
problem Learning revenue-optimal auctions from corrupted or perturbed samples.
method Proves upper bounds, proposes algorithms for learning near-optimal auctions.
result Proves tight upper bounds and proposes algorithms for near-optimal auctions.
Paper develops a fair pricing algorithm for dynamic settings with uncertain demand.
problem Fair pricing in dynamic, uncertain demand scenarios.
method Contextual bandit algorithm with dynamic pricing and demand learning.
result Achieves optimal regret bound with fairness constraints.
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 learning-to-rank approach ensures fairness for item providers in dynamic ranking systems.
problem Myopically optimizing user utility can be unfair to item providers in two-sided markets.
method A controller that integrates unbiased estimators for fairness and utility, dynamically adapting as more data becomes available.
result Empirically, the algorithm is highly practical and robust, ensuring amortized group fairness.
Efficient sequential matching of supply and demand is a problem of interest in many online to offline services. For instance, Uber, Lyft, Grab for matching taxis to customers; Ubereats, Deliveroo, FoodPanda etc for matching restaurants to customers. In these online to offline service problems, individuals who are respo…
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 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…
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.
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.
'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 …
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.
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.
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.
Develops fair classifiers robust to training distribution perturbations.
problem Ensuring fairness in classifiers robust to training data perturbations.
method Formulates a min-max objective function to minimize distributionally robust training loss while maintaining fairness for perturbed distributions. Uses an iterative online learning algorithm to find a fair and robust classifier.
result Our classifier maintains fairness and accuracy for a wide range of perturbations compared to state-of-the-art fair classifiers.
FaiREE provides fair classification with guarantees for small datasets.
problem Fairness in classification often requires large sample sizes and distributional assumptions.
method FaiREE offers finite-sample and distribution-free fairness guarantees.
result FaiREE achieves optimal accuracy and satisfies various fairness notions.
UDJ-FL framework achieves multiple distributive justice-based fairness metrics in federated learning.
problem Ensuring fairness in federated learning across different client data distributions.
method UDJ-FL framework uses aleatoric uncertainty-based client weighing and fair resource allocation techniques.
result UDJ-FL achieves egalitarian, utilitarian, Rawls' difference principle, and desert-based fairness metrics.
Paper shows fairness and domain adaptation can work together.
problem Algorithmic bias and distributional shifts in ML models.
method Leveraging fairness and distribution shifts, the paper shows how domain adaptation methods can mitigate bias.
result Enforcing individual fairness can improve out-of-distribution accuracy under covariate shift.
Optimizes web publisher revenues from RTB auctions.
problem Maximizing revenue from RTB auctions with limited information.
method Incremental time-weighted matrix factorization for user and placement profiles; Aalen's Additive model for censored bid predictions.
result Significant revenue increase for web publishers.
FedFaiREE addresses fairness in decentralized learning with small samples.
problem Ensuring fairness in decentralized federated learning with limited data.
method FedFaiREE is a post-processing algorithm for distribution-free fair learning in decentralized settings with small samples.
result FedFaiREE provides theoretical guarantees for both fairness and accuracy in decentralized environments.
Develops framework for valuing and assessing risk of renewable PPAs.
problem Valuation and risk assessment of non-standard renewable PPAs.
method Formalizes payoff structures, derives fair contract prices, proposes market risk-assessment methodology.
result Fair prices and risk profiles vary across technologies and contractual structures.
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.
The paper develops a method to achieve fairness in predictions using Wasserstein barycenters.
problem Learning a fair real-valued function independent of sensitive attributes.
method Establishing a connection between fair regression and optimal transport theory, deriving a close form expression for the optimal fair predictor as the Wasserstein barycenter of sensitive groups.
result The optimal fair predictor's distribution is the Wasserstein barycenter of sensitive groups' distributions, offering an intuitive interpretation and a simple post-processing algorithm.
Bayesian data selection framework ensures fairness in machine learning models.
problem High computational costs and limited scalability of fairness-aware methods.
method Bayesian data selection framework using generalized discrepancy measures.
result Consistently outperforms existing methods in fairness and accuracy.
CFFL framework improves fairness in FL without sacrificing accuracy.
problem Overfitting and lack of collaborative fairness in Federated Learning.
method CFFL framework uses reputation to ensure participants converge to different models.
result CFFL achieves high fairness, comparable accuracy, and better performance than Standalone and Distributed frameworks.
This paper introduces individual fairness in clustering using f f f -divergence.
problem Ensuring fair clustering by treating similar individuals similarly.
method Uses f f f -divergence to measure statistical similarity and assigns individuals to probability distributions over cluster centers. result Provides an algorithm with provable approximation guarantee for clustering with individual fairness constraints.
Proposes a fair machine learning framework robust to distribution shifts without causal graph knowledge.
problem Fairness issues in machine learning models under distribution shifts.
method Stochastic distributionally robust optimization with Exponential Renyi Mutual Information (ERMI) fairness measure.
result First stochastic framework for fair learning robust to distribution shifts without causal graph knowledge.
Fairness measures fail in predictive settings that intentionally shift outcomes.
problem Fairness measures fail in performative prediction settings.
method Formalized concept shift and counterfactual outcomes.
result Predictors that are fair during training become unfair during deployment.
New ranking system balances fairness and user utility.
problem Achieving group fairness in ranking systems.
method Formulated a minimax game between a ranking player and an adversary.
result Better utility for highly fair rankings.
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.
New approach for fair predictions under changing data distributions.
problem Fairness in classification algorithms under covariate shift.
method Proposes a robust predictor that satisfies fairness and maintains statistical properties of source data.
result Demonstrates improved fairness and target performance on benchmark tasks.
Boosting improves data fitting while maintaining fairness guarantees.
problem Ensuring fairness in data preprocessing.
method Boosting algorithm to learn sufficient statistics of exponential families.
result The learned distribution maintains fairness guarantees while fitting the data better.
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.
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.
Current methodologies in machine learning analyze the effects of various statistical parity notions of fairness primarily in light of their impacts on predictive accuracy and vendor utility loss. In this paper, we propose a new framework for interpreting the effects of fairness criteria by converting the constrained lo…
Develops a Bayesian model to predict business revenue and demand.
problem Estimating revenue and demand at business facilities.
method Variational Bayesian spatial interaction model (BSIM) with scalable inference.
result BSIM outperforms competing approaches in predicting pub revenue and demand.
Study analyzes Airbnb lead-time distributions for Nights Booked and Gross Booking Value, finding divergent shapes and tail behavior.
problem Analyzing lead-time distributions for Airbnb demand metrics.
method Compositional analysis of daily lead-time vectors, fitting Gamma, Weibull, and Lognormal distributions, using generalized Pareto for tail inference.
result Lead-time distributions for Nights Booked and Gross Booking Value diverge, with GBV concentrating more in mid-range horizons.