This paper proposes BFTR (Budget-First Tariff Recommendation), a complete algorithmic framework integrating eight Budget-First strategies, including two original hybrid approaches: Recursive Hybrid (conditional interpolation) and Knapsack-First Hybrid (priority knapsack).
Abstract
Telecom operators traditionally offer predefined tariff grids, forcing users to choose from a limited set of plans. This paper proposes BFTR (Budget-First Tariff Recommendation), a complete algorithmic framework integrating eight Budget-First strategies, including two original hybrid approaches: Recursive Hybrid (conditional interpolation) and Knapsack-First Hybrid (priority knapsack). Unlike existing approaches that adjust prices upward to guarantee a minimum margin, BFTR guarantees the absence of overcharging by systematically aligning the final price with the catalog reference price. We mathematically formalize each strategy, prove the existence of an offer for any positive budget, and prove that the price deviation (surcharge) is zero for all strategies that do not use interpolation with correction. A detailed comparative analysis confronts BFTR to ten main existing tariff models on ten dimensions. Experiments on a dataset of 974 customers inspired by the Nigerian MTN market show that: (i) Recursive Hybrid is optimal for the customer (100% budget used, 29.9 GB volume, utility 0.946, 0% overcharging), (ii) Piecewise offers the highest volume (39.7 GB) with 0% overcharging, (iii) Power Law provides an excellent compromise (99.9% budget, 38.1 GB, 0% overcharging). All strategies achieve a zero surcharge, confirming the theoretical guarantees. A sensitivity analysis on the weighting parameter alpha (0.2 - volume priority, 0.5 - balance, 0.8 - budget priority) shows that utility rankings evolve logically. Execution times (<10 ms) and very low failure rates (0% for robust strategies) confirm the operational viability of the system. The formal proof of the absence of overcharging constitutes a major theoretical contribution.
This work investigates the uncertainty-aware joint pricing and matching problem for dynamic high-capacity ride-sharing services, where passengers are assumed to be price-elastic and decide whether to accept a ride-sharing offer based on the upfront prices provided by the platform. We formulate the studied problem as a...
Wang Chen, Xing-Lu Liu, Kai-Hang Zhang et al.· 0 citations
Trade discounts are among the fastest-acting profit levers available to a distributor of fast-moving consumer goods (FMCG). A distributor typically receives a limited discount budget from the manufacturer and must decide how to spread it across the matrix of stock-keeping units (SKUs) and customers so that company prof...
N. Rabimov, A. Akhatov, M. Khamidov· Международный Журнал Теорети...· 0 citations
Local Flexibility Markets (LFMs) require Distribution System Operators (DSOs) to determine both the quantity of flexibility to procure and the corresponding willingness to pay during market clearing. Existing approaches typically rely on unrealistic centralized AC-OPF clearing algorithms or strictly localized, static f...
Savvas Panagi, Chrysovalantis Spanias, P. Aristidou· 1 citation
A novel distributionally robust model for the Operator-oriented Point-of-interest Recommendation Problem (OO-POIRP) with demand uncertainty is proposed, aiming to assist operators in minimizing cooperation cost, ticket booking cost, promotion cost, and transportation cost.
Ze-Xin Li, Zun-Hao Luo, Qiu-Lin Li et al.· Information Technology & Tou...· 0 citations
This work provides a large-scale empirical audit of DEX routing using 2.98 million WETH-USDC swaps on Ethereum and demonstrates that sandwiching attacks drive a significant fraction of routing sub-optimality.
Last-mile delivery platforms operating in quick-commerce settings face an inherent tension between operational efficiency and equitable distribution of work among riders. We propose a multi-objective optimization framework for the dynamic, real-time assignment of delivery orders to a rider fleet, governed by a tunable...
Milon Bhattacharya, Milan Kumar· Asia-Pacific Journal of Oper...· 0 citations